Emergence of Global Network Property based on Multi-agent Voting Model

Size: px
Start display at page:

Download "Emergence of Global Network Property based on Multi-agent Voting Model"

Transcription

1 Emrgn of Glol Ntwork Proprty s on Multi-gnt Voting Mol Kosuk Shino Ntionl Dfns Amy -- Hshirimizu, Yokosuk Kngw, Jpn kshino@n..jp Yutk Mtsuo Ntionl Institut of Avn Inustril Sin n Thnology -- Sotoknn, Chiyo Tokyo, Jpn y.mtsuo@ist.go.jp Hiyuki Nkshim Futur Univrsity, Hkot Hokkio, Jpn h.nkshim@fun..jp ABSTRACT Rnt stuis hv shown tht vrious mols n xplin th mrgn of omplx ntworks, suh s sl-fr n smll-worl ntworks. This ppr prsnts iffrnt mol to gnrt omplx ntworks using multi-gnt pproh. Eh no is onsir s n gnt. Bs on y ll gnts, gs r rptly. W us four iffrnt kins of ntrlity msurs s utility funtions for gnts. Dpning on th ntrlity msur, th rsultnt ntworks iffr onsirly: typilly losnss ntrlity gnrts sl-fr ntwork, gr ntrlity prous rnom grph, twnnss ntrlity fvors rgulr grph, n ignvtor ntrlity rings omplt sugrph. Th importn of th ntwork strutur mong gnts is wily not in th multi-gnt rsrh litrtur. This ppr ontriuts nw insights into th onntion twn gnts lol hvior n th glol proprty of th ntwork strutur. W sri til nlysis on why ths struturs mrg, n prsnt isussion of th possil xpnsion n pplition of th mol. Ctgoris n Sujt Dsriptors I. [Artifiil Intllign]: Distriut Artifiil Intllign Gnrl Trms Dsign, Exprimnttion. INTRODUCTION Soil ntworks r riv muh ttntion in th multignt rsrh ommunity s wll s othr rsrh omins suh s W thnology [], uiquitous thnology [] n soil sin []. Rntly, soil ntworking srvis (SNSs) hv om populr on th W. Eh usr rgistrs thir Prmission to mk igitl or hr opis of ll or prt of this work for prsonl or lssroom us is grnt without f provi tht opis r not m or istriut for profit or ommril vntg n tht opis r this noti n th full ittion on th first pg. To opy othrwis, to rpulish, to post on srvrs or to ristriut to lists, rquirs prior spifi prmission n/or f. WOODSTOCK El Pso, Txs USA Copyright X ACM X-XXXXX-XX-X/XX/XX...$.. quintns, thry mrting lrg soil ntwork. Vrious pplitions us soil ntworks,.g., informtion rommntion [] n informtion shring []. Th SNSs r onsir s multi-gnt systms: h gnt (or usr) intrts lolly, rgistring frins n quintns, xhnging informtion y writing n ommnting on wlogs (logs). Svrl stuis hv rgr soil ntwork s multi-gnt systm n propos pplitions suh s informtion rommntion [] n pulition srh []. Dspit th importn of soil ntworks for multi-gnt systms, fw stuis hv n onut into th ntur of lol hvior n glol ntwork proprtis. Som stuis hv rvl tht th ovrll prformn is mrkly influn y th ntwork strutur mong gnts [, ]. Howvr, if w xmin th pplition to soil ntwork systms suh s informtion rommntion, it is nssry to hv knowlg out how lol hvior will prou th ovrll ntwork strutur, rthr thn how th prformn iffrs pning on givn ntwork strutur. In this ppr, w propos growing ntwork mol from th multi-gnt point of viw, whih is intn to show th insight twn th lol hvior of th gnts n th rsultnt ntwork strutur. In our mol, h gnt (rogniz s no) ttmpts to inrs thir utility y ing nw gs. Th ition of n g might prfrr y som gnts, ut not y othr gnts. Rsultnt onflits mong gnts n rsolv using systm. This sitution is unrstoo n justifi y svrl soil ntwork xmpls in th rl worl: For xmpl, in lrg orgniztion, som popl slts othrs to join thir liqu, n thry strngthn it. In politil orgniztions n mi orgniztions, popl somtims try to grow thir own groups. Thy nourg othrs to mor onnt to thir group. Thrfor, it is importnt to invstigt ntwork proprtis s on n grmnt mong multipl gnts. Our prolm stting is s follows: h gnt is onsir s no. A nw g is gnrt through grmnts mong gnts, s ror through vot. Th nwly invnt g inrss th rsptiv utilitis of som gnts. This pross is itrt n th ntwork oms mor onnt. W us ntrlity msurs for utility funtions. Cntrlity, whih rprsnts how ntrl n tor is in soil ntwork, hs n long stui in th fil of soil ntwork nlysis. Espilly, w slt four ntrlity msurs, gr, losnss, twnnss n PgRnk ntrl-

2 ity, n show tht th sltion of ntrlity msur yil signifint iffrn in glol ntwork proprtis. Th ontriution of th ppr n summriz s follows: W show how lol intrtion n grmnt mong gnts onsists iffrnt ntwork proprtis. Our mol is simpl; for tht rson, w n show th si phnomnon involving lol hviors n glol proprtis. Our rsults r usful in th sign of soil ntwork srvis y multi-gnt systm, spilly in rltion to rommntions of informtion, popl, n ommunitis. W show th prliminry nlysis of n tul soil ntwork, n isuss th ppliility of our finings for rommntion systm. Th ppr is orgniz s follows. In th nxt stion, w sri rlt stuis. Thn w xplin th lgorithm of our simultion in mor til. Stion n r vot to rsults of simultion n thortil nlysis on th rsults. Stion isusss th xpnsion n ppliility of th mol, n w onlu th ppr.. RELATED WORKS Som stuis hv invstigt intrtions mong gnts n systm hvior t th olltiv lvl [, ]. Axtll shows th ffts of istint gnt intrtion n ovrll struturs in rtirmnt hvior n firm formtion. Gston monstrt tht th soil ntwork strutur unrlying n gnt orgniztion n hv onsirl impt on orgniztionl prformn. In ths stuis, ntwork mol is givn suh s ltti, rnom grph, or smll-worl grph. Although th motivtion is similr towr th importn of ntwork strutur mong gnts, th pprohs of thos stuis n ours r iffrnt, or strngthn h othr: it is importnt not only to know th rltion twn rtin ntwork strutur n th ovrll prformn, ut lso th rltion twn lol hvior n ntwork struturs. Mhnism of ntwork gnrtion suh s sl-fr or smll worl ntworks r stui in th ontxt of omplx ntworks [, ]. Th most populr xplntion of sl-fr ntworks is prfrntil tthmnt: A nwly rt no is onnt to pr-xisting on with proility proportionl to th numr of gs of th trgt no. Othr mols inlu onnting nrst-nighor mol n mutul sltion mol [], oth of whih xplin th mrgn of sl-fr ntworks. In th lttr mol, nw g is s on mutul ffinity twn nos, whih n onsir s simpl multi-gnt systm. Howvr, most stuis o not mploy th multi-gnt systm: thy o not xpliitly hv gnts ision, gols or utility funtions. A similr stuy to ours is tht of ntwork gms, whih invstigts th ynmi formtion n volution of ntworks. Jkson n Wtts propos mol [] in whih ll gnts hv th sm vlu funtion n in whih nw gs r y grmnt twn two gnts whn thy mt rnomly. Our mol is istinguish from th on in tht stuy us w mploy systm s glol grmnt mhnism; morovr, w lrify th rltion to ntwork struturs suh s sl-fr or rnom grph. Soil ntworks r importnt for vrious multi-gnt systms. In th prvious stion, w sri stuis using soil ntworks for informtion rommntions n istriut srhs [, ]. Anothr mjor pplition is trust n rputtion lultion: In th Rgrt systm propos y Str [], rputtion is lult s on soil ntwork nlyss. Pujol t l. vlop mtho to lult rputtion using only lol informtion. It n pt pt to th ntwork topology []. Ashri t l. proposs mtho to vlut th trustworthinss of gnt s ountrprts, s on n nlyss of rltionships []. Our stuy n ontriut to ths rsrh fforts y gnrting pproprit soil ntworks pning on thir intn purposs.. SIMULATION MODEL In this stion, w first ovrviw ntrlity msurs, whih r stui in soiology. Th ntrlity msur is us to rprsnt th utility of n gnt in our mol. Th ovrll stting of th simultion is xplin nxt. In our mol, nos r onsir s gnts, n gs r onsir s rltions twn gnts, whih r non-irtionl n riprol.. Cntrlity s Utility Soil ntwork nlysis inlus vrious msurs of no ntrlity tht trmin th rltiv importn of no within th ntwork []. It rprsnts th struturl importn of no, whih n prhps hrtriz s th powr of iniviul tors. Among th svrl kins of ntrlity msurs [], th most populr ons r gr, losnss, twnnss, n ignvtor ntrlity. In our mol, w ssum tht h gnt sks to inrs its ntrlity. In othr wors, ntrlity is us s proxy for utility, whih is to mximiz. Our intuition is simpl: rognizing tht tritionl stuis in soil sin hv shown th usfulnss of ntrlity s msur of powr, why not infr it s proxy for utility? In othr wors, w ssum tht n gnt hvs to inrs its powr tht n lult y ntrlity msur. In our mol, w us four kins of ntrlity msur: Dgr Th gr of no is th numr of gs to othr nos. Ators who hv mor tis to othr tors might in n vntgous positions. It is fin s Ci D = k i whr ki is th gr of no i n N N is th numr of ll nos. Closnss Closnss ntrlity pturs how los n tor is to ll th othr tors. It is lult y th minimum istn of n tor to ll othr nos. Unlik othr ntrlity msurs, th smllr th vlu is, th mor ntrl th tor. It is fin s Ci C = (L i) = P N j G ij whr Li is th vrg gosi istn of no i, n ij is th istn twn no i n j. To filitt lultion for isonnt omponnts, w st ij = N if nos i n j r isonnt. Btwnnss Th twnnss ntrlity msurs inits tht n tor is in fvor position if th tor flls on th shortst pths twn othr pirs of tors in th ntwork. It msurs th numr of ll th shortst pths tht go through th no, n is fin s th following. Ci B = P j,k N n jk(i)/n jk In tht qution,

3 [] NxtStp: slt nits rnomly. [] [] slt nits rnomly. [] [] This g wins. This g wins. Figur : Exmpl of ntwork growth. n jk nots th numr of th shortst pths twn no j n k, n n jk (i) is th numr of thos running through no i. PgRnk PgRnk [] ws propos s msur of th importn of W pg. Although PgRnk orrspons to ignvtor ntrlity (unr propr trnsformtion), w us PgRnk us of its fmilirity to omputr sin rsrhrs. It is lult itrtivly s th following. Ci P (t + ) = αa i + ( α) P j B i Cj P (t)/d j Thrin, D j is th gr of no j, B i is th numr of nighors of no i, A i is vtor rprsnting th sour of th ntwork. W st α =. n A i s uniform: h lmnt of A i is /N. This lultion is itrt until C P onvrgs.. Simultion Stting W first xplin th motivtion of our simultion mol using oupl of xmpls. Th first xmpl is highwy onstrution mong itis. Assum tht th itis initilly hv no highwys. Rsint of ithr ity woul hppy if highwy is onstrut twn two itis. Th nxt highwy might onstrut nywhr ls, ut vry ity wnts it us it improv th losnss ntrlity, i.., itizns gin onvnin. Consquntly, possil solution is tht thy i th issu through ngotition or. Svrl nits xist for th onstrution of highwy; vry ity vot for on of thm. Th winnr prforms th tul onstrution. In this mnnr, itis grully om mor onnt. A possil rsult might n mrgn of hu ity: vry itizn trvl to othr itis in short tim if thr is suh hu ity. W n tk nothr xmpl in soil ntwork in n orgniztion or group. A prson woul lik to position twn popl to thry mintin ontrol of informtion flow, i.. to inrs twnnss ntrlity. In this sitution, th rsultnt ntwork is lss likly to hv hus us popl woul ompt to hol tht ntrl position. Bs on suh intuitions, w sign our simultion in th following mnnr. Eh gnt is sprt t first. Th nit gs r slt nxt. Evry gnt hs prfrns on th ition of n g, us ition of n g woul inrs or rs th gnt s utility, i.., ntrlity msur. Eh gnt vots for th nit gs, n th g with th most vots is vntully. This rpt pross rnrs th ntwork s inrsingly onnt. In our simultion, w us th fst lgorithm to lult th twnnss []. [] []. Initiliz Assum N nos. St th numr of nits s.. Choos nits Slt no rnomly. Among th possil gs from th no, slt on rnomly s nit. Rpt until th numr of nits is, or until thr r no possil gs.. Evlut nits n vot Eh no vluts h nit using th utility funtion f. Sor th nits in rsing orr s,,...,. If multipl nits xist with th sm utility, orr thm rnomly.. A n g A n g orrsponing to th nit with th highst sor.. Trmint Trmint if th numr of gs grtr thn givn numr, or if no possil gs xists. Othrwis rpt th itrtion n go k to. Figur : Simultion prour. An illustrtion is prsnt in Figur. Initilly, w hv fiv nos n two gs, n thr nit gs whih r hosn rnomly from possil gs. Eh gnt vots for on nit. In this s, Eg otins two vots, Eg otins zro, n Eg otins thr vots. Consquntly, Eg is. Thn w hv nothr thr nits, n on of thm is going to uilt. Dtils of th simultion prour r shown in Figur. Svrl points r rquir for onsirtion: How to slt nits Thr r svrl wys to hoos nit gs. W mploy simpl on: w slt gs rnomly from th possil nw gs. W us prmtr, whih nots th numr of nits. If is lrg, th g will hosn mong mny possil gs; if is, th prour is ompltly rnom. Sor of nits Eh gnt vlut th nit using givn ntrlity msur (on of gr, losnss, twnnss, n PgRnk), n vot to thm. W ssum tht ll th gnts us th sm ntrlity to s how iffrnt ntwork woul ppr. Voting Vrious wys xist for. As mtho, w opt Bor ounting, s vis y Jn-Chrls Bor. Th mtho is us for singl-st or multiplst ltions. Bus it somtims lts roly ptl nits, th Bor ount is oftn sri s onsnsus-s ltorl systm, Eh gnt puts points to th first hoi, points to th son hoi, n point for th lst fvorl hoi. Th nit with th highst sor wins.. RESULTS AND OVERALL PROPERTY In this stion, w sri rsults of ntwork gnrtion simultion. Espilly, w xmin iffrns mong th four ntrlity msurs.

4 Figur : Ntwork growth using losnss ntrlity s utility. N=, =. Up to gs.. Closnss Cntrlity Figur shows how ntwork grows whn using losnss ntrlity s gnts utility. W st th numr of nos N to n th numr of nits to. In h ntwork, tn gs r nwly. Not tht nos r position for visuliztion. For tht rson, th position n th istn of nos imply nothing. Initilly, th ntwork hs N nos without gs. Whn w gs, svrl smll omponnts r gnrt first, whih r susquntly onnt togthr, thry rting ig isln (whn th numr of gs K is ). Th lrg omponnt grully gts lrgr onnting othr isolt nos. Finlly, ll nos r onnt (whn K=). W n s two nos with high gr. Ths r ll hus. Susquntly, nos oms grully mor irtly onnt to ithr of th two hus. Whn K=, lmost vry no is onnt through th two hus. If w rs, th g sltion oms mor rnom. It thrfor oms unlikly tht hu will mrg. If w inrs, th ntwork will show on or two hus. Figur shows th gr istriution of th gnrt ntwork. W s th powr-lw istriution in th s of losnss ntrlity (Figur ()) us it forms stright lin on logrithmi-linr plot. Chrtristilly, ths ntworks hv mg-hu, i.. no with hug gr. Figur shows som proprtis of gnrt ntworks. Rgring losnss, th hrtristi pth lngth L is th smllst mong thm. Th lustring offiint C is s low s rnom grph. As oms lrgr, L gts smllr, whih mns lrgr hu(s) pprs.. Btwnnss Cntrlity Figur shows ntwork growth using twnnss ntrlity. Initilly, th ntwork grows similrly to tht of losnss ntrlity, until th gint omponnt inlus ll th nos t K=. Aftrwr, th gs onnting two nos in smll istn r onnt. Typilly, thr pprs ntwork with gs onnting only nighors, s shown in W us spring-m mol for ntwork rwing. P(k) P(k) k () Closnss k () Dgr P(k) P(k) k () Btwnnss k () PgRnk Figur : Dgr istriution of ntwork (N=, =, k =.) Figur. Th rson is unrstoo to th following: for h gnt to inrs twnnss ntrlity, L shoul lrg. Lrg L inits long shortst pths. Consquntly, h no tns to inlu in th shortst pths. W n s tht L is lrg s shown in Tl ompr to othr ntworks. If gts lrgr, L gts lrgr too. Th gr istriution of ntwork is shown in Figur (): Most nos hv gr of ; vn th lrgst gr is smllr thn.. Dgr Cntrlity Figur illustrts th ntwork growth using gr ntrlity. Initilly, thr ppr svrl pirs of nos; thy r grully onnt. Howvr, th ntwork os not show hus or string-typ growth. Isolt nos r not sily onnt to th lrgst omponnt. Thrfor, thr r svrl isolt nos vn t K=.

5 l= l= l= Figur : Ntwork growth using twnnss ntrlity. N=, =. Up to gs. l= Tl : L n C for iffrnt vlus. ntrlity L C Closnss. (.). (.) Closnss. (.). (.) Closnss. (.). (.) Closnss mx. (.). (.) Btwnnss. (.). (.) Btwnnss. (.). (.) Btwnnss. (.). (.) Btwnnss mx. (.). (.) Dgr. (.). (.) Dgr. (.). (.) Dgr. (.). (.) Dgr mx. (.). (.) PgRnk. (.). (.) PgRnk. (.). (.) PgRnk. (.). (.) PgRnk mx. (.). (.) N =, K =. W show L n C with isolt nos n without isolt nos in th prnthss. In s of gr ntrlity, th ition of nw g ffts only th gr ntrlity of nos t oth ns. It hs no glol ffts: Eh nit g otins soli vots only from th oth ns, Othr nos will vot rnomly. Thus th rsultnt ntwork is rnom grph. Th gr istriution of ntwork is shown in Figur (). It follows Poisson istriution with mo vlu of. Tl shows tht C n L r smll, whih is lso th hrtristis of rnom grph.. PgRnk Figur illustrts th ntwork growth using PgRnk. Most nos r isolt vn if w suffiint numr of gs; Aout % of th nos r isolt t K=. Only frtion of th nos r onnt. Ths nos r highly onnt, onsisting lmost omplt grph. If w look t Tl, L is vry lrg if w inlu th isolt nos. Howvr, L within th onnt omponnts is s low s.-.. C is vry lrg ompr to othr ntworks. Th gr istriution in Figur () shows th Figur : A typil s using twnnss ntrlity. N=, =, K= (right-si) n K= (lftsi). g f Figur : Illustrtion of g ition in s of losnss ntrlity. uniform istriution on grs.. MECHANISM OF NETWORK GROWTH In this stion, w invstigt ntwork growth mor thortilly. W xplin how n why ntwork of iffrnt typs r mrg. W omit th xplntion of gr ntrlity hr us th rsultnt ntwork is rnom. For th rson, it is sy to unrstn th mhnism.. Closnss Cntrlity Th ntwork using losnss ntrlity is hrtriz y th mrgn of hus. W onsir th mhnism of th hu pprn y showing tht nwly gs strngthn th hu whn givn hu. Figur xmplifis th sitution whr hu is going to gnrt: th ntwork hs thr gs mong svn nos. No hs thr gs n is smll hu. Assum tht four gs (s shown in ott lins) r slt s

6 l= l= l= l= Figur : Ntwork growth using gr ntrlity. N =, =. Up to gs. Tl : Expt numr of vots in s of losnss. f g Sum Eg.. Eg Eg.. Eg nits. W not no tht links to hu suh s No,, s priphrl no. Ths n four g tgoris, whih n sri s follow: Eg n g whih onnts hu n n isolt no, Eg n g whih onnts two priphrl nos, Eg n g whih onnts priphrl no n n isolt no, n Eg n g whih onnts two isolt nos. Th xpt numr of vots of h nit is shown in Tl. Bus w hv four nits, h no vots points of,,, n for four gs. Th xpt vots r th vrg of th two nits if th utilitis for two nits r sm. W n s tht Eg gts th highst sor. For h priphrl no, th g onnting itslf n n isolt no is th first hoi, ut th g twn th isolt no n th hu is th son hoi. An isolt no hooss th nits tht onnt itslf to othr nos, ut hs no prfrn on othr nits. In this wy, th nit twn hu n n isolt no gts th most vots, whih mks hu mor onnt n strongr. This kin of phnomnon is visil in som rl-worl xmpls. Lt us tk n irlin ntwork for xmpl. Eh Tl : Expt numr of vots with fw nos. Sum initil (.) (.) (.) (.) (.) Eg (.) (.) (.) (.) (.) Eg (.) (.) (.) (.) (.) W show th PgRnk vlus in th prnthsis. () () () Figur : Illustrtion of g ition in s of twnnss ntrlity. irlin hs fw hu irports. Vrious ustomrs in iffrnt rgions wnt to onnt to othr itis y shortr istns: thy wnt to inrs losnss ntrlity. Thrfor, th mrgn of hus r usful in glol situtions. In similr illustrtiv xmpl, this sitution is osrv in supply hin ntwork of vrious inustris. Eh ompny prfrs short hin, thry nourging th mrgn of oupl of gint ompnis glolly. In this sitution, h no om to ovrly rly on oupl of hus too muh, prouing vulnrility ginst hu ttk, s is known to our in sl-fr ntworks,. Btwnnss Cntrlity Two phss prtin in ntwork growth whn using twnnss ntrlity: In th first phs, isolt nos r onnt until ll nos r onnt. In this phs, w n ssum two typs of g nit, s pit in Figur ();

7 l= l= l= l= Figur : Ntwork growth using PgRnk ntrlity. N =, =. Up to gs. Tl : Expt numr of vots with lrg numr of nos.... Sum initil (.) (.) (.) (.) (.) (.)... (.) Eg (.) (.) (.) (.) (.) (.)... (.) Eg (.) (.) (.) (.) (.) (.)... (.) Eg An g within th onnt omponnt, n Eg, Eg An g whih onnts onnt omponnt n n isolt no. Th formr oftn rs twnnss of th nos in th omponnt us th g will prou shortst pths with lss istns, thus smllr numr of nos r inlu in th shortst pths. Contrrily, th lttr lwys inrs twnnss us th xisting shortst pths rmin n thr will nw shortst pths. Compring Eg n Eg, Eg inrss th twnnss of No n No, whrs Eg inrss only tht of No. As rsult, Eg gts high sor of thn Eg. In this wy, ntwork lngthns n th imtr inrss (s in Figur ()). In th son phs, ll th nos r lry onnt. No ition of n g inrss twnnss, ut whih nit rss twnnss ntrlity t lst? Th st gs on tht point r thos onnting two nos with istn of two. W n s thos gs in Figur () s ott lins. In this wy, mny will pprnt in th ntwork. Whn h gnts wnt to ntrl in trms of informtion flow (s in ururti orgniztions) th ntwork tns to hv lrg L, somtims rsulting in lss ffiiny.. PgRnk Cntrlity W ssum simpl s first s in Figur to unrstn th mhnism of PgRnk ntrlity. Two g typs xist: () () Figur : Illustrtion of g ition in s of PgRnk ntrlity. Eg n g within onnt omponnt, n Eg n g whih onnts onnt omponnt n n isolt no. Eg is slt whr th isolt nos r fw, s in Figur (). Figur shows th xpt vots for Eg n Eg: Eg rivs mor vots. Howvr, in ss with numrous nos s in Figur (), th sitution is iffrnt. Eg is slt s in Figur. Eh isolt no vots for Eg us th rs of th numr of isolt nos implis th rs of PgRnk vlu. As rsult, PgRnk mks ns onnt omponnt with numrous gs; th numr of th onnt omponnt inrss vry slowly. Suh sitution is somtims osrv in rl-worl soil ntworks suh s OTAKU ommunitis in Jpn. Som gs form strong group, n othr nos pprntly rsist onntion. Th prolm is pprntly smll onntivity mong th ovrll nos.

8 . DISCUSSION Bus w sign our mol s simpl s possil, som importnt lmnts wr nglt in our mol. Thos lmnts shoul invstigt in th furthr stuis: (i) Egs r monotonously inrsing in our mol. Howvr, in rl-worl ntwork, gs n lt. Also nos n n lt. (ii) Cntrlity msurs rquir knowlg of glol ntwork topology (xpt gr ntrlity). W n hng th mol to us th go-ntri ntrlity msurs. (iii) W n mix iffrnt gnts with iffrnt ntrlity msurs n xmin th mnnr in whih th ntwork grows. Similrly, w n sign utility funtion s wight sum of svrl ntrlity msurs n osrv th rsultnt ntworks. (iv) W mploy Bor ount for, ut w might ltrntivly us ngotition mol, or som othr form to hiv grmnts mong gnts. Atully, w hv tri svrl xpnsion ut w wr unl to inlu thir sriptions in this ppr us of th sp limittion. W shll rport thos rsults in futur pprs. On pplition of our mol is th nlysis of th ntwork. W n infr whih ntrlity msur omints in n tul soil ntwork. For xmpl, w hv invstigt soil ntwork of mi rsrhrs in Jpns Soity for Artifiil Intllign (JSAI) [], n fin tht twnnss ntrlity n losnss ntrlity r two mjor ingrints with wights of. n. orrsponingly. Bs on th nlysis, w n uil rommntion systm in onfrn support systms []: h usr gnt lults th utility otin whn th usr is onnt to othr prsons. Th systm mks rommntion to oth prsons so tht thy gt quint if oth (n nighoring) gnts gr to th possil onntion. Our mol is usful in vrious soil systms tht mploy multi-gnt rhittur.. CONCLUSION W hv propos n mol of th growing ntwork. This mol inlus no in ntwork s n gnt tht vots s on utility funtion. Diffrnt ntrlity msurs ngnr iffrnt ntworks: sl-fr ntwork (losnss), rnom grph (gr), rgulr grph (twnnss), n omplt grph (PgRnk). W n us our mol in vrious kins of multi-gnt systms, spilly of soil systms. Atully, th motivtion of our rsrh lis in th vlopmnt of rommntion systms in mi onfrns. Although svrl imnsions tht rquir mor invstigtion in our mol, w liv tht this rsrh provis hlpful insights towr glol ntwork proprtis n lol ision from th multignt prsptiv.. REFERENCES [] R. Ashri, S. Rmhurn, J. Str, M. Luk, n N. Jnnings. Trust vlution through rltionship nlysis. In Pro. AAMAS,. [] R. Axtll. Effts of Intrtion Topology n Ativtion Rgim in Svrl Multi-Agnt Systms, pgs. Springr,. From our xprin, without suh mhnism, h usr gnt simply rommns onntion to uthorittiv prsons, whih is not pproprit for th ommunity. [] A.-L. Brási. LINKED: Th Nw Sin of Ntworks. Prsus Pulishing, Cmri, MA,. [] A. Birukou, E. Blnziri, n P. Giorgini. Multi-gnt systm tht filitts sintifi pulitions srh. In Pro. AAMAS,. [] U. Brns. A fstr lgorithm for twnnss ntrlity. Journl of Mthmtil Soiology, ():,. [] S. Brin n L. Pg. Th ntomy of lrg-sl hyprtxtul w srh ngin. In Pro. th WWW Conf.,. [] L. C. Frmn. Cntrlity in soil ntworks: Conptul lrifition. Soil Ntworks, :,. [] M. G. Gston. Agnt-orgniz ntworks for ynmi tm formtion. In Pro. AAMAS,. [] T. Hop, M. Hmski, Y. Mtsuo, n T. Nishimur. Strngthning ommunity with moi soil ntworks. In Pro. HCI,. [] M. Jkson n A. Wtts. Th volution of soil n onomi ntworks. Journl of Eonomi Thory, :,. [] Y. Mtsuo, J. Mori, M. Hmski, H. Tk, T. Nishimur, K. Hsi, n M. Ishizuk. POLYPHONET: An vn soil ntwork xtrtion systm. In Pro. WWW,. [] J. Mori, M. Ishizuk, T. Sugiym, n Y. Mtsuo. Rl-worl orint informtion shring using soil ntworks. In Pro. ACM GROUP,. [] W. Njl, S. Ghit, n R. Piu. Smntilly rih rommntions in soil ntworks for shring, xhnging n rnking smnti ontxt. In Pro. ISWC,. [] A. S. Pntln. Soilly wr omputtion n ommunition. IEEE Computr,. [] J. Pujol, R. Sngüs, n J. Dlgo. Extrting rputtion in multi gnt systms y mns of soil ntwork topology. In Pro. AAMAS,. [] J. Str n C. Sirr. Rputtion n soil ntwork nlysis in multi-gnt systms. In Pro. AAMAS,. [] S. St, P. Domingos, P. Mik, J. Golk, L. Ding, T. Finin, A. Joshi, A. Nowk, n R. Vllhr. Soil ntworks ppli. IEEE Intllignt Systms, pgs,. [] W. Wng, B. Hu, T. Zhou, B. Wng, n Y. Xi. Mutul sltion mol for wight ntworks. Physil Rviw E,,. [] S. Wssrmn n K. Fust. Soil ntwork nlysis. Mthos n Applitions. Cmrig Univrsity Prss, Cmrig,. [] D. Wtts. Six Dgrs: Th Sin of Connt Ag. W. W. Norton & Compny,. [] B. Wllmn. Th glol villg: Intrnt n ommunity. Th Arts & Sin Rviw, Univrsity of Toronto, ():,. [] J. Wng, C. Mio, n A. Goh. Trust-s gnt ommunity for ollortiv rommntion. In Pro. AAMAS,.

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not

More information

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1. Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y

More information

12. Traffic engineering

12. Traffic engineering lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}

More information

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs. Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,

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

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

CSC Design and Analysis of Algorithms. Example: Change-Making Problem CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =

More information

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018 CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs

More information

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes. Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right

More information

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon

More information

Section 10.4 Connectivity (up to paths and isomorphism, not including)

Section 10.4 Connectivity (up to paths and isomorphism, not including) Toy w will isuss two stions: Stion 10.3 Rprsnting Grphs n Grph Isomorphism Stion 10.4 Conntivity (up to pths n isomorphism, not inluing) 1 10.3 Rprsnting Grphs n Grph Isomorphism Whn w r working on n lgorithm

More information

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely . DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn

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

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt

More information

Planar Upward Drawings

Planar Upward Drawings C.S. 252 Pro. Rorto Tmssi Computtionl Gomtry Sm. II, 1992 1993 Dt: My 3, 1993 Sri: Shmsi Moussvi Plnr Upwr Drwings 1 Thorm: G is yli i n only i it hs upwr rwing. Proo: 1. An upwr rwing is yli. Follow th

More information

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem) 12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr

More information

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl

More information

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)

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

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f

More information

COMP108 Algorithmic Foundations

COMP108 Algorithmic Foundations Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht

More information

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Similarity Search. The Binary Branch Distance. Nikolaus Augsten. Similrity Srh Th Binry Brnh Distn Nikolus Augstn nikolus.ugstn@sg..t Dpt. of Computr Sins Univrsity of Slzurg http://rsrh.uni-slzurg.t Vrsion Jnury 11, 2017 Wintrsmstr 2016/2017 Augstn (Univ. Slzurg) Similrity

More information

Garnir Polynomial and their Properties

Garnir Polynomial and their Properties Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,

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

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008 Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is

More information

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht

More information

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality: CS2: Grphs Prihr Ch. 4 Rosn Ch. Grphs A olltion of nos n gs Wht n this rprsnt? n A omputr ntwork n Astrtion of mp n Soil ntwork CS2 - Hsh Tls 2 Dirt Grphs Grphs/Ntworks Aroun Us A olltion of nos n irt

More information

0.1. Exercise 1: the distances between four points in a graph

0.1. Exercise 1: the distances between four points in a graph Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook

More information

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl

More information

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem) 4/25/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 2 Eulr s rig prolm

More information

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths. How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0

More information

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1 CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml

More information

Present state Next state Q + M N

Present state Next state Q + M N Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I

More information

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12 Aministrivi: CS61B Ltur #33 Autogrr will run this vning. Toy s Rings: Grph Struturs: DSIJ, Chptr 12 Lst moifi: W Nov 8 00:39:28 2017 CS61B: Ltur #33 1 Why Grphs? For xprssing non-hirrhilly rlt itms Exmpls:

More information

CS 461, Lecture 17. Today s Outline. Example Run

CS 461, Lecture 17. Today s Outline. Example Run Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h

More information

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson

More information

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s? MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth

More information

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation A Simpl Co Gnrtor Co Gnrtion Chptr 8 II Gnrt o for singl si lok How to us rgistrs? In most mhin rhitturs, som or ll of th oprnsmust in rgistrs Rgistrs mk goo tmporris Hol vlus tht r omput in on si lok

More information

EE1000 Project 4 Digital Volt Meter

EE1000 Project 4 Digital Volt Meter Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s

More information

Analysis for Balloon Modeling Structure based on Graph Theory

Analysis for Balloon Modeling Structure based on Graph Theory Anlysis for lloon Moling Strutur bs on Grph Thory Abstrt Mshiro Ur* Msshi Ym** Mmoru no** Shiny Miyzki** Tkmi Ysu* *Grut Shool of Informtion Sin, Ngoy Univrsity **Shool of Informtion Sin n Thnology, hukyo

More information

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2 Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny

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

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This

More information

Sybil Attacks and Defenses

Sybil Attacks and Defenses CPSC 426/526 Syil Attks n Dfnss Ennn Zhi Computr Sin Dprtmnt Yl Univrsity Rll: L-5 Rputtion systms: - Why w n rputtion/trust systms - Wht is glol rputtion mol - Wht is prsonliz rputtion mol - Cs stuis:

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

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013 CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or

More information

Problem solving by search

Problem solving by search Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming

More information

Numbering Boundary Nodes

Numbering Boundary Nodes Numring Bounry Nos Lh MBri Empori Stt Univrsity August 10, 2001 1 Introution Th purpos of this ppr is to xplor how numring ltril rsistor ntworks ffts thir rspons mtrix, Λ. Morovr, wht n lrn from Λ out

More information

A PROPOSAL OF FE MODELING OF UNIDIRECTIONAL COMPOSITE CONSIDERING UNCERTAIN MICRO STRUCTURE

A PROPOSAL OF FE MODELING OF UNIDIRECTIONAL COMPOSITE CONSIDERING UNCERTAIN MICRO STRUCTURE 18 TH INTERNATIONAL CONFERENCE ON COMPOSITE MATERIALS A PROPOSAL OF FE MODELING OF UNIDIRECTIONAL COMPOSITE CONSIDERING UNCERTAIN MICRO STRUCTURE Y.Fujit 1*, T. Kurshii 1, H.Ymtsu 1, M. Zo 2 1 Dpt. o Mngmnt

More information

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S. ConTst Clikr ustions Chtr 19 Physis, 4 th Eition Jms S. Wlkr ustion 19.1 Two hrg blls r rlling h othr s thy hng from th iling. Wht n you sy bout thir hrgs? Eltri Chrg I on is ositiv, th othr is ngtiv both

More information

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140

More information

CS 241 Analysis of Algorithms

CS 241 Analysis of Algorithms CS 241 Anlysis o Algorithms Prossor Eri Aron Ltur T Th 9:00m Ltur Mting Lotion: OLB 205 Businss HW6 u lry HW7 out tr Thnksgiving Ring: Ch. 22.1-22.3 1 Grphs (S S. B.4) Grphs ommonly rprsnt onntions mong

More information

Register Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012

Register Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012 Rgistr Allotion W now r l to o rgistr llotion on our intrfrn grph. W wnt to l with two typs of onstrints: 1. Two vlus r liv t ovrlpping points (intrfrn grph) 2. A vlu must or must not in prtiulr rhitturl

More information

Seven-Segment Display Driver

Seven-Segment Display Driver 7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on

More information

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1 Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ):

More information

Journal of Solid Mechanics and Materials Engineering

Journal of Solid Mechanics and Materials Engineering n Mtrils Enginring Strss ntnsit tor of n ntrf Crk in Bon Plt unr Uni-Axil Tnsion No-Aki NODA, Yu ZHANG, Xin LAN, Ysushi TAKASE n Kzuhiro ODA Dprtmnt of Mhnil n Control Enginring, Kushu nstitut of Thnolog,

More information

Formal Concept Analysis

Formal Concept Analysis Forml Conpt Anlysis Conpt intnts s losd sts Closur Systms nd Implitions 4 Closur Systms 0.06.005 Nxt-Closur ws dvlopd y B. Gntr (984). Lt M = {,..., n}. A M is ltilly smllr thn B M, if B A if th smllst

More information

Chapter 9. Graphs. 9.1 Graphs

Chapter 9. Graphs. 9.1 Graphs Chptr 9 Grphs Grphs r vry gnrl lss of ojt, us to formliz wi vrity of prtil prolms in omputr sin. In this hptr, w ll s th sis of (finit) unirt grphs, inluing grph isomorphism, onntivity, n grph oloring.

More information

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas SnNCutCnvs Using th Printl Stikr Funtion On-o--kin stikrs n sily rt y using your inkjt printr n th Dirt Cut untion o th SnNCut mhin. For inormtion on si oprtions o th SnNCutCnvs, rr to th Hlp. To viw th

More information

Trees as operads. Lecture A formalism of trees

Trees as operads. Lecture A formalism of trees Ltur 2 rs s oprs In this ltur, w introu onvnint tgoris o trs tht will us or th inition o nroil sts. hs tgoris r gnrliztions o th simpliil tgory us to in simpliil sts. First w onsir th s o plnr trs n thn

More information

Computational Biology, Phylogenetic Trees. Consensus methods

Computational Biology, Phylogenetic Trees. Consensus methods Computtionl Biology, Phylognti Trs Consnsus mthos Asgr Bruun & Bo Simonsn Th 16th of Jnury 2008 Dprtmnt of Computr Sin Th univrsity of Copnhgn 0 Motivtion Givn olltion of Trs Τ = { T 0,..., T n } W wnt

More information

In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions.

In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions. Crystl Rports for Visul Stuio.NET In orr to lrn whih qustions hv n nswr orrtly: 1. Print ths pgs. 2. Answr th qustions. 3. Sn this ssssmnt with th nswrs vi:. FAX to (212) 967-3498. Or. Mil th nswrs to

More information

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata CSE303 - Introduction to th Thory of Computing Smpl Solutions for Exrciss on Finit Automt Exrcis 2.1.1 A dtrministic finit utomton M ccpts th mpty string (i.., L(M)) if nd only if its initil stt is finl

More information

A Low Noise and Reliable CMOS I/O Buffer for Mixed Low Voltage Applications

A Low Noise and Reliable CMOS I/O Buffer for Mixed Low Voltage Applications Proings of th 6th WSEAS Intrntionl Confrn on Miroltronis, Nnoltronis, Optoltronis, Istnul, Turky, My 27-29, 27 32 A Low Nois n Rlil CMOS I/O Buffr for Mix Low Voltg Applitions HWANG-CHERNG CHOW n YOU-GANG

More information

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA. S i m p l i y i n g A l g r SIMPLIFYING ALGEBRA www.mthltis.o.nz Simpliying SIMPLIFYING Algr ALGEBRA Algr is mthmtis with mor thn just numrs. Numrs hv ix vlu, ut lgr introus vrils whos vlus n hng. Ths

More information

Multipoint Alternate Marking method for passive and hybrid performance monitoring

Multipoint Alternate Marking method for passive and hybrid performance monitoring Multipoint Altrnt Mrkin mtho or pssiv n hyri prormn monitorin rt-iool-ippm-multipoint-lt-mrk-00 Pru, Jul 2017, IETF 99 Giuspp Fiool (Tlom Itli) Muro Coilio (Tlom Itli) Amo Spio (Politnio i Torino) Riro

More information

Plan. I Gale-Shapley Running Time. I Graphs. I Motivation and definitions I Graph traversal: BFS and DFS

Plan. I Gale-Shapley Running Time. I Graphs. I Motivation and definitions I Graph traversal: BFS and DFS Pln CS : Grphs: BFS n DFS Dn Shlon Gl-Shply Running Tim Grphs Motivtion n finitions Grph trvrsl: BFS n DFS Frury, 0 Running Tim of Gl-Shply? nitilly ll ollgs n stunts r fr whil som ollg is fr n hsn t m

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook

More information

ECE 407 Computer Aided Design for Electronic Systems. Circuit Modeling and Basic Graph Concepts/Algorithms. Instructor: Maria K. Michael.

ECE 407 Computer Aided Design for Electronic Systems. Circuit Modeling and Basic Graph Concepts/Algorithms. Instructor: Maria K. Michael. 0 Computr i Dsign or Eltroni Systms Ciruit Moling n si Grph Conptslgorithms Instrutor: Mri K. Mihl MKM - Ovrviw hviorl vs. Struturl mols Extrnl vs. Intrnl rprsnttions Funtionl moling t Logi lvl Struturl

More information

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ h ln ony, hrunk th t ihr nr omputr in n nginring nivrsity of shington t omprssion onpts ossy t omprssion osslss t omprssion rfix os uffmn os th y 24 2 t omprssion onpts originl omprss o x y xˆ nor or omprss

More information

Module 2 Motion Instructions

Module 2 Motion Instructions Moul 2 Motion Instrutions CAUTION: Bor you strt this xprimnt, unrstn tht you r xpt to ollow irtions EXPLICITLY! Tk your tim n r th irtions or h stp n or h prt o th xprimnt. You will rquir to ntr t in prtiulr

More information

Section 3: Antiderivatives of Formulas

Section 3: Antiderivatives of Formulas Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin

More information

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata A 4-stt solution to th Firing Squ Synhroniztion Prolm s on hyri rul 60 n 102 llulr utomt LI Ning 1, LIANG Shi-li 1*, CUI Shung 1, XU Mi-ling 1, ZHANG Ling 2 (1. Dprtmnt o Physis, Northst Norml Univrsity,

More information

Efficient Broadcast in MANETs Using Network Coding and Directional Antennas

Efficient Broadcast in MANETs Using Network Coding and Directional Antennas Effiint Brost in MANETs Using Ntwork Coing n Dirtionl Antnns Shuhui Yng Dprtmnt of Computr Sin Rnsslr Polythni Institut Troy, NY 28 Ji Wu n Mihl Cri Dprtmnt of Computr Sin n Enginring Flori Atlnti Univrsity

More information

WORKSHOP 6 BRIDGE TRUSS

WORKSHOP 6 BRIDGE TRUSS WORKSHOP 6 BRIDGE TRUSS WS6-2 Workshop Ojtivs Lrn to msh lin gomtry to gnrt CBAR lmnts Bom fmilir with stting up th CBAR orinttion vtor n stion proprtis Lrn to st up multipl lo ss Lrn to viw th iffrnt

More information

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan LOCUS 58 SOLVED EXAMPLES Empl Lt F n F th foci of n llips with ccntricit. For n point P on th llips, prov tht tn PF F tn PF F Assum th llips to, n lt P th point (, sin ). P(, sin ) F F F = (-, 0) F = (,

More information

DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF 2 2 MATRICES AND 3 3 UPPER TRIANGULAR MATRICES USING THE SIMPLE ALGORITHM

DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF 2 2 MATRICES AND 3 3 UPPER TRIANGULAR MATRICES USING THE SIMPLE ALGORITHM Fr Est Journl o Mthtil Sins (FJMS) Volu 6 Nur Pgs 8- Pulish Onlin: Sptr This ppr is vill onlin t http://pphjo/journls/jsht Pushp Pulishing Hous DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF MATRICES

More information

Graph-Based Workflow Recommendation: On Improving Business Process Modeling

Graph-Based Workflow Recommendation: On Improving Business Process Modeling Grph-Bs Workflow ommntion: On Improving Businss Pross Moling Bin Co Collg of Computr Sin Zhjing Univrsity Hngzhou Chin 37 oin@zju.u.n Dongjing Wng Collg of Computr Sin Zhjing Univrsity Hngzhou Chin 37

More information

Graph Theory. Vertices. Vertices are also known as nodes, points and (in social networks) as actors, agents or players.

Graph Theory. Vertices. Vertices are also known as nodes, points and (in social networks) as actors, agents or players. Stphn P. Borgtti Grph Thory A lthough grph thory is on o th youngr rnhs o mthmtis, it is unmntl to numr o ppli ils, inluing oprtions rsrh, omputr sin, n soil ntwork nlysis. In this hptr w isuss th si onpts

More information

(a) v 1. v a. v i. v s. (b)

(a) v 1. v a. v i. v s. (b) Outlin RETIMING Struturl optimiztion mthods. Gionni D Mihli Stnford Unirsity Rtiming. { Modling. { Rtiming for minimum dly. { Rtiming for minimum r. Synhronous Logi Ntwork Synhronous Logi Ntwork Synhronous

More information

MULTIPLE-LEVEL LOGIC OPTIMIZATION II

MULTIPLE-LEVEL LOGIC OPTIMIZATION II MUTIPE-EVE OGIC OPTIMIZATION II Booln mthos Eploit Booln proprtis Giovnni D Mihli Don t r onitions Stnfor Univrsit Minimition of th lol funtions Slowr lgorithms, ttr qulit rsults Etrnl on t r onitions

More information

Greedy Algorithms, Activity Selection, Minimum Spanning Trees Scribes: Logan Short (2015), Virginia Date: May 18, 2016

Greedy Algorithms, Activity Selection, Minimum Spanning Trees Scribes: Logan Short (2015), Virginia Date: May 18, 2016 Ltur 4 Gry Algorithms, Ativity Sltion, Minimum Spnning Trs Sris: Logn Short (5), Virgini Dt: My, Gry Algorithms Suppos w wnt to solv prolm, n w r l to om up with som rursiv ormultion o th prolm tht woul

More information

Aquauno Video 6 Plus Page 1

Aquauno Video 6 Plus Page 1 Connt th timr to th tp. Aquuno Vio 6 Plus Pg 1 Usr mnul 3 lik! For Aquuno Vio 6 (p/n): 8456 For Aquuno Vio 6 Plus (p/n): 8413 Opn th timr unit y prssing th two uttons on th sis, n fit 9V lklin ttry. Whn

More information

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued... Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th

More information

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations Mr Funtins Grphs, Pruts, & Rltins Unirt Grphs An unirt grph is pir f 1. A st f ns 2. A st f gs (whr n g is st f tw ns*) Friy, Sptmr 2, 2011 Ring: Sipsr 0.2 ginning f 0.4; Stughtn 1.1.5 ({,,,,}, {{,}, {,},

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

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths Dt Strutur LECTURE Shortt pth lgorithm Proprti of hortt pth Bllmn-For lgorithm Dijktr lgorithm Chptr in th txtook (pp ). Wight grph -- rminr A wight grph i grph in whih g hv wight (ot) w(v i, v j ) >.

More information

Graph Contraction and Connectivity

Graph Contraction and Connectivity Chptr 17 Grph Contrtion n Conntivity So r w hv mostly ovr thniqus or solving prolms on grphs tht wr vlop in th ontxt o squntil lgorithms. Som o thm r sy to prllliz whil othrs r not. For xmpl, w sw tht

More information

1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers.

1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers. Mth 0 Exm - Prti Prolm Solutions. Dtrmin whthr or not th ollowing inry rltions r quivln rltions. B sur to justiy your nswrs. () {(0,0),(0,),(0,),(,),(,),(,),(,),(,0),(,),(,),(,0),(,),(.)} on th st A =

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

5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem

5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem Thorm 10-1: Th Hnshkin Thorm Lt G=(V,E) n unirt rph. Thn Prt 10. Grphs CS 200 Alorithms n Dt Struturs v V (v) = 2 E How mny s r thr in rph with 10 vrtis h of r six? 10 * 6 /2= 30 1 Thorm 10-2 An unirt

More information

Basis of test: VDE 0660, part 500/IEC Rated peak withstand current I pk. Ip peak short-circuit current [ka] Busbar support spacing [mm]

Basis of test: VDE 0660, part 500/IEC Rated peak withstand current I pk. Ip peak short-circuit current [ka] Busbar support spacing [mm] Powr istriution Short-iruit withstn strngth to EC Short-iruit withstn strngth to EC 439-1 Typ tsting to EC 439-1 During th ours of systm typ-tsting, th following tsts wr onut on th Rittl usr systms n on

More information

C-201 Sheet Bar Measures 1 inch

C-201 Sheet Bar Measures 1 inch Janine M. lexander, P.. P.. No. 9, L 0 N. PRK RO, SUIT 0 HOLLYWOO, LORI 0 PHON: (9) - X: (9) 08- No.: 9 I ST SRIPTION Y GT VLVS SHLL RSILINT ST, MNUTUR TO MT OR X TH RQUIRMNTS O WW 09 (LTST RVISION) N

More information

This chapter covers special properties of planar graphs.

This chapter covers special properties of planar graphs. Chptr 21 Plnr Grphs This hptr ovrs spil proprtis of plnr grphs. 21.1 Plnr grphs A plnr grph is grph whih n b rwn in th pln without ny gs rossing. Som piturs of plnr grph might hv rossing gs, but it s possibl

More information

UNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii

UNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii - Nming frtions Chptr Frtions Eh shp rprsnts ONE whol. i ii Wht frtion is shdd? Writ s frtion nd in words. Wht frtion is not shdd? Writ s frtion nd in words. i ii i ii Writ s mny diffrnt frtions s you

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

Outline. Binary Tree

Outline. Binary Tree Outlin Similrity Srh Th Binry Brnh Distn Nikolus Austn nikolus.ustn@s..t Dpt. o Computr Sins Univrsity o Slzur http://rsrh.uni-slzur.t 1 Binry Brnh Distn Binry Rprsnttion o Tr Binry Brnhs Lowr Boun or

More information

Multi-Section Coupled Line Couplers

Multi-Section Coupled Line Couplers /0/009 MultiSction Coupld Lin Couplrs /8 Multi-Sction Coupld Lin Couplrs W cn dd multipl coupld lins in sris to incrs couplr ndwidth. Figur 7.5 (p. 6) An N-sction coupld lin l W typiclly dsign th couplr

More information