SUPPLEMENTARY INFORMATION
|
|
- Douglas Brooks
- 5 years ago
- Views:
Transcription
1 oi: /ntur05770 Supplntry Figur 1 g h SUPPEMENTARY FIGURE 1 Exprssion o th ProCDKA;1:CDKA;1:YFP trnsgn. -, Fluorsn irogrphs showing 4',6-Diiino-2-phnylinol (DAPI- stin nuli (, n yllow luorsnt protin (YFP luorsn (, in k;1 -/- polln rsu y ProCDKA;1:CDKA;1:YFP usion onstrut (hrtr rrr to s k;1 -/- ; CDKA;1:YFP., In htrozygous k;1 -/- ; k;1:yp +/- plnts, two lsss o polln r prou. Th irst lss rprsnts wil-typ-lik polln with on vgttiv ll (strisks n two gts (rrowhs., All nuli r rk y YFP luorsn, th two spr lls nuli (rrowhs strongr thn th vgttiv ll nulus., Th son polln lss rsls k;1 utnt polln with on vgttiv ll (strisks n only on gt (rrowh., Ths polln show only vry int YFP signl. -, Projtions o onol Z-sris showing YFP luorsn in Col x k;1 -/- ;CDKA;1:YFP +/+ ss. Both rtiliztion prouts, th ryo (rrowhs n th nospr r rk y YFP luorsn., Col x k;1 -/- ; CDKA;1:YFP +/+ s 2..p.., Col x k;1 -/- ;CDKA;1:YFP +/+ s 4..p.. g-h, Projtions o onol Z-sris showing YFP luorsn n r utoluorsn in -/- x k;1 -/- ; k;1:yp +/- ss t 6..p.. g, -/- x k;1 -/- ; k;1:yp +/- s pollint y wil-typ-lik polln rrying th CDKA;1:YFP onstrut n xprssing YFP in th rrst hrt-stg ryo (rrowh n th nospr. h, In th sll rsu ss in -/- x k;1 -/- ; k;1:yp +/- rosss, th ryo (rrowh n th nospr o not show YFP luorsn, initing tht ths ss wr gnrt y YFP-ngtiv k;1 utntlik polln. 1
2 oi: /ntur05770 Supplntry Figur 2 g h i wil typ is-lss is-lss x k;1 + /- SUPPEMENTARY FIGURE 2: Enospr irntition in +/- n i +/- utnts pollint with k,1 +/- polln isplys wil-typ hrtristis. -, Z-sris projtions o onol irogrphs showing th KS22 grn luorsnt protin (GFP signl n r utoluorsn., In wil typ ss, KS22 xprssion is onin to rly nospr vlopnt, whrs, in i-11 utnts, GFP xprssion prsists in th orting ss., In i-11 +/- x k;1 +/- ss, lss o sll rsu ss is tt tht stop xprssing KS22 s thy tur. -, Mirogrphs showing G222 GUS rportr-gn tivity s lu stining in th nospr., In th turing wil-typ s th GUS rportr G222 is xprss in th nospr., Th nospr o ss os not irntit n os not xprss th G222 GUS rportr., In sll +/- x k;1 +/- rsu ss, G222 is xprss s in h wil typ. g-i, Mirogrphs o s stions showing nospr llulriztion. g, In wil-typ ss, th nospr strts to or ll wlls roun th lt hrt stg ryo. h, In orting ss th nospr os not llulriz. i, In sll -/- x k;1 +/- rsu ss, th nospr llulrizs. Arvitions r: is-lss, +/- or i +/- utnts; k;1 +/-, htrozygous k;1 utnt. Sl rs r 100µ. 2
3 oi: /ntur05770 Supplntry Figur 3 s r ( (n =1 x 01 CD KA ;1 :Y FP + /+ (n =3 x 5, YF k P+ ;1:y p +/ (n =9 x 6, YP k F- ;1:y p + / (n =1 s 0 1 l 100 root lngth ( grintion rt (% (n r x =1 C 01 ol (n r x =1 01 k, Y ;1 FP :y + p +/- (n r s =1 l r x YFP+ (n=63 25 r x YFP+ (n= x YFP(n= x YFP(n=64 1..g. 3..g. 5..g. g h i k l plnt ry wight (g ;1 :Y FP + /+ (n =2 x 5, YF k P+ ;1:y p +/ (n =2 x 7, YF k P- ;1:y p + / KA (n =2 x 6 CD (n =1 s 6 l (n r x =2 5, k YF ;1 P+ :y p +/- (n r x =2 C 8 ol (n r s =2 l 5 0 SUPPEMENTARY FIGURE 3: Post-ryo vlopnt o -/- x CDKA;1:YFP+/- F1 plnts., S siz o -/- x k;1:yp+/- F1 ss. Ss o th -/- x k;1:yp+/- ross tht lk YFP (signt YFP-, r nur 7 rwww.ntur.o/ntur likly to prou y YFP-ngtiv k;1 utnt-lik polln n to vlop with uniprntl, iploi nospr. Thy 2 r signiintly sllr thn ss o th s -/- x k;1:yp+/- ross tht rry YFP (signt YFP+, r nur 6 whih hv vlop s th wil typ with triploi, iprntl nospr. Sttistil nlysis ws pror using th Stunt-Nwn-KulsTst. -/- x k;1:yp+/- YFP-ngtiv ss or th only r o hoognous sust tht ws signiintly irnt ro ll othr susts. For th surnts, only vil-looking, i.. light rown, pl ss wr hosn., Grintion o -/- x k;1:yp+/- F1 plnts. F1 ss o r x Col n -/- x k;1:yp+/- rosss wr slt oring to th ritrion whthr thy wr vil-looking, i.. light rown n pl, or not. Vi-looking ss wr tst or grintion on gr plts. In r x Col, 99% o th ss grint, whil in -/- x k;1:yp+/- F1 ss roun 88% o th sll rsu ss grint. Error rs rprsnt th stnr vition twn thr inpnnt rosss., Root growth rt o -/- x k;1:yp+/- F1 plnts. F1 slings o r x Col n -/- x k;1:yp+/- rosss wr put on vrtil gr plts. Root growth ws sur 1, 3, n 5 ys tr grintion (..g.. t grinting slings wr not tkn into ount. Slings ro -/- x k;1:yp+/-rosss sting ro sll rsu ss h shortr roots thn th r x Col ontrol t 1..g.. Although th n growth rt pr y o th sll rsu slings (0.46 ws slightly highr thn th on o wil typ ontrol (0.40, uring th irst 5 ys o root growth, thy oul not th up with th wil-typ slings. -, Typil F1 plnts o r x Col n -/- x k;1:yp+/- rosss t 7..g. on gros plts., r x Col., Th roots o -/- x k;1:yp+/- F1 r rkly sllr thn th ons o r x Col plnts. -l, F1 plnts o -/- x k;1:yp+/- rosss n o th orrsponing ontrols 28..g.., r sl. g, r x Col. h, r x k;1:yp+/-, YFP positiv. i, -/- sl. k, -/- x Col. l, -/- x k;1:yp+/-, YFP ngtiv. Th -/- x k;1:yp+/- YFP ngtiv plnts r rkly sllr thn th ontrol plnts., Finl ioss o th -/- x k;1:yp+/- F1 ospring. Dry wight o th shoots ov th rostt lvs o -/- x k;1:yp+/- F1 plnts n th ontrol groups sur tr th plnts i n ri out. Th F1 plnts tht grow ro -/x k;1:yp+/- YFP-ngtiv ss (YFP- inlly rh th s siz s th ons rrying YFP (YFP+ n thir wil-typ ontrols. Sttistil nlysis ws pror using th Stunt-Nwn-Kuls-Tst. -/- x k;1:yp+/- (YFP- F1 plnts (r nur 7 or highly signiint hoognous sust with F1 YFP-positiv plnts ro -/- x k;1:yp+/- (YFP+ n F1 plnts ro th -/- x k;1-/-; CDKA;1:YFP+/+ ross. Not tht th rosss twn irnt Ariopsis ssions tn to uult or ioss, proly u to htrosis ts (Myr, R. C. t l., Plnt Physiol 134, [2004]. Th rs show th vrg vlus, rror rs rprsnt th stnr vition. Piturs o ss wr tkn with i stro irosop n susquntly th s surs projt on th piturs wr trin with th DISKUS sotwr pkg (Crl H. Hilgrs Thnishs Büro, vrsion Mn vlus r pitur y th rs, rror rs rprsnt th stnr vition. Arvitions r:, hoozygous utnt; YFP+, -/- x k;1:yp+/- ss rrying th YFP, thror rprsnting ss rt y YFP-positiv wil-typ-lik polln ; YFP-, -/- x k;1:yp+/- ss lking th YFP, thror rprsnting ss rt y YFP-ngtiv k;1 utnt-lik polln; n, nur o plnts sur. Sl rs r 0.2 in n, n 2 in -l. 3
4 oi: /ntur /- x -/- Supplntry Figur 4 -/- x k;1+/- YABBY SHOOT MERISTEMESS (STM WUSCHE (WUS SUPPEMENTARY FIGURE 4 Exprssion pttrn o YABBY, SHOOT MERISTEMESS (STM n WUSCHE (WUS RNA in vloping -/- n -/- x k;1+/- ryos., Exprssion pttrn o YABBY in -/- in otylons o vloping hrt stg ryo., YABBY in -/- x k;1+/- ryo ro sll s. Arrows init loliz xprssion., STM xprssion in hrt stg ryo shoot pil rist (SAM,, siilr STM SAM xprssion in -/- x k;1+/- ryo ro s stg., oliz WUS xprssion in th lowr prt o th SAM in wil typ hrt stg ryo,, loliz WUS xprssion in -/- x k;1+/- ryo t th s stg. Stion is rott 90 grs opr to stions -. In situ hyriiztion n prossing o tissu ws pror s sri prviously (Jkson DP (1991 In situ hyriistion in plnts. In: Bowls DJ, Gurr SJ, MPhrson M (s Molulr plnt pthology: prtil pproh. Oxor Univrsity Prss, Oxor, pp Hyriiztion pros r sri in; STM (ong J, Brton MK. Initition o xillry n lorl rists in Ariopsis. Dv Biol F 15;218(2:341-53, WUS (Shoo H, nhr M, Hkr A, Myr KF, Jurgns G, ux T. Th st ll popultion o Ariopsis shoot rists in intin y rgultory loop twn th CAVATA n WUSCHE gns. Cll Mr 17;100(6:635-44, YABBY (Sigri KR, Esh Y, Bu SF, Otsug D, Drws GN, Bown J. Mrs o th YABBY gn ily spiy xil ll t in Ariopsis. Dvlopnt Sp;126(18: Sl rs r 50 µ. 4
5 oi: /ntur05770 SUPPEMENTARY TABE 1 Flowring ti in -/- x k;1 +/- F1 gnotyp o prnts (l x l n (..g. stv n sust r sl r x Col r x CDKA;1:YFP +/ n 3 -/- x CDKA;1:YFP +/ n 3 -/- sl n 3 -/- x k;1:yp +/- (+YFP /- x k;1:yp +/- (-YFP hoognous susts s trin y Stunt-Nwn-Kuls-Tst...g., ys tr grintion; n, nur o F1 plnts sor; CDKA;1:YFP +/+, hoozygous k;1 -/- utnt rsu y hoozygous Pro CDKA;1 :CDKA;1:YFP onstrut opltly oplnting th k;1 utnt phnotyp; k;1:yp +/-, hoozygous k;1 -/- utnt rsu y htrozygous Pro CDKA;1:CDKA;1:YFP onstrut phnoopying th htrozygous k;1 +/- utnt; (+YFP, F1 ss rrying th Pro CDKA;1 :CDKA;1:YFP onstrut; (-YFP, F1 ss not rrying th Pro CDKA;1 :CDKA;1:YFP onstrut
6 oi: /ntur05770 SUPPEMENTARY TABE 2 Prir squns n qrt PCR pros n prir squns (5-3 trgt sit ACT_2_102_R CGCTCTTTCTTTCCAAGCTC ACTIN2 (At3g18780right prir or quntittiv RT-PCR ACT_2_102_ ACT_2_102 Aplion CCGGTACCATTGTCACACAC ACTIN2 (At3g18780 lt prir or quntittiv RT-PCR CGCTCTTTCTTTCCAAGCTC ATAAAAAATGGCTGAGGCTG ATGATATTCAACCAATCGTGT GTGACAATGGTACCGG 77 nt plion o ACT_2_102 lt n right prirs or quntittiv RT-PCR. Th UP#102 pro squn is highlight in ol itlis. J504 BA1_EXT N034_S N035_AS N048_S N049_AS ND10_S ND13_AS ND14_AS ND15_S GCGTGGACCGCTTGCTGCA ACTCTCTCAGG TGGTTCACGTAGTGGGGCCA TCG CCAGATTCTCCGTGGAATTG CG GGAGATCGACTCCATCGGG ATC CAGATCTCTTCCTGGTTATTC ACA TGTACAAGCGAATAAAGACA TTTGA AACACAAGTTTGTACAAAAAA GCAGGCTTCAACAATGGATC AGTACGAGAAAG AACACCACTTTGTACAAGAA AGCTGGGTCTTACTTGTACA GCTCGTCC CTTGCTCACCATAGGCATGC CTCCAAGATCCT GGAGGCATGCCTATGGTGA GCAAGGGCGAGG lt orr T-DNA prir or k;1-1 (Slk inry vtor pbin-rok lt orr T-DNA prir or k;1-1 (Slk inry vtor pbin-rok wil-typ CDKA;1, xon 4 wil-typ CDKA;1, xon 7 wil-typ CDKA;1, intron 4 wil-typ CDKA;1, intron 6 Gtwy ttb1-rointion sit n 5 strt o th CDKA;1 CDS n o th YFP CDS plus Gtwy ttb2-rointion sit usion prir: CDKA;1 or plus YFP ovrlp usion prir : YFP or plus CDKA ;1 ovrlp
7 oi: /ntur05770 NGA6 upstr prir ATGGAGAAGCTTACACTGAT C sipl squn polyorphis NGA6 ownstr prir PHE1_147_R TGGATTTCTTCCTCTCTTCAC sipl squn polyorphis CGTAGCCCGTACAACTCGAT PHERES1 right prir or quntittiv RT-PCR PHE1_147_ PHE1_147 Aplion CATCACTTCTTCAACGCCTT C CGTAGCCCGTACAACTCGAT CCAGGAGCCTTGGCCATCA AGGGAAGGCGTTGAAGAAG TGATG PHERES1 lt prir or quntittiv RT-PCR 63 nt plion o PHE1_147 lt n right prirs or quntittiv RT-PCR. Th UP#147 pro squn is highlight in ol itlis. Fi-11_F Fi-11_R ATTGGCTCACCACACTTAGA ACTTCATAGC TGTACAATTGTCTCGGAGAT GGTGCC orwr RFP-prir to rogniz th i-11 lll (igst Bsp1286I; wt: 293p+325p, i-11: 618p rvrs RFP-prir to rogniz th i-11 lll (igst Bsp1286I; wt: 293p+325p, i-11: 618p
Above. Below H&E. Above CD4. CD11b. Fluoromyelin BDA BDA BDA. Cerebral cortex. Focal lesion. Thoracic cord. Lumbar cord. Hindlimb placing score
1. 1. 1 1 3 Tim tr lsion inution () wks wks 3 1 1 1 3 Tim tr lsion inution () i Ltrl sor. Mil Aov Blow.. 1 wk On sgmnt ov g 3. Lsion Fluoromylin Fluoromylin h CD11 Hinlim pling sor CD Aov Blow Fol lsion
More information, 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 informationQUESTIONS 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 informationQUESTIONS 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 informationDecimals DECIMALS.
Dimls DECIMALS www.mthltis.o.uk ow os it work? Solutions Dimls P qustions Pl vlu o imls 0 000 00 000 0 000 00 0 000 00 0 000 00 0 000 tnths or 0 thousnths or 000 hunrths or 00 hunrths or 00 0 tn thousnths
More informationOutline. 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 informationCycles 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 informationCEDAR ISLAND / KEATON BEACH TAYLOR COUNTY, FLORIDA POST-HURRICANE HERMINE EXAMINATION SURVEY FY16 4-FOOT PROJECT
10 9 8 7 6 5 JUG ISLN R KL H R H R ROSMR LN W W HITTIL R JO MORGN R LRW TR RK R L M PNSOL GUL G O R G I TLLHSS JKSONVILL ORLNO OO TMP TLNTI ON N US rmy orps of ngineers Jacksonville istrict ST ON THIS
More informationDesigning A Concrete Arch Bridge
This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr
More informationCSC 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 informationSolutions 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 informationPresent 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 informationECE 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 informationCOMPLEXITY 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 informationEE1000 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 informationLeucine-Rich Repeat Transmembrane Proteins Instruct Discrete Dendrite Targeting in an Olfactory Map
12 hrs APF N/n82 Hon t l, 2009 Luin-Rih Rpt Trnsmmrn Protins Instrut isrt nrit Trtin in n Oltory Mp Wizh Hon 1, Hito Zhu 1, Christophr J. Pottr 1, Grill Brsh 1, Mitsuhiko Kurusu 2,3, Ki Zinn 2, Liqun Luo
More information12 - M G P L Z - M9BW. Port type. Bore size ø12, ø16 20/25/32/40/50/ MPa 10 C to 60 C (With no condensation) 50 to 400 mm/s +1.
ris - MP - Compt gui ylinr ø, ø, ø, ø, ø, ø, ø, ø ow to Orr Cln sris lif typ (with spilly trt sliing prts) Vuum sution typ (with spilly trt sliing prts) ir ylinr otry tutor - M P - - MW ll ushing ring
More informationb. 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 informationSUPPLEMENTARY INFORMATION
DOI:.38/n2816 Primr pir C lox P lox P Primr pir B Primr pir A - WT CM KO WT ES -50 kd -37 kd flox/flox X ZP3 Cr/Cr flox/+ -ZP3 Cr/+ flox/flox -ZP3 Cr/+ flox/flox -ZP3 Cr/+ X X flox/flox flox/flox Ooyts
More informationCSE 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 informationSUPPLEMENTARY INFORMATION
DOI:.38/n74 nti-cd63 P lls P CX AP BL lnxin Tsg Wnt5A Evi Apil suprntnt P Co-2 lls % Gol prtils 6 4 2 Wg ntioy unspii ontrol
More informationPage 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 informationGraphs. 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 informationUsing 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 informationTangram 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 informationFace 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 informationlearning 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 informationWhy 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 information12/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 information5/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 informationCOMP108 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# 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 informationConstructive 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 information1. 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 informationSection 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 informationSimilarity 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 information1 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 informationOutline. 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 informationOutline. 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(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 informationDUET 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 informationAn 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 informationCS61B 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 informationGraphs. 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 informationLIVING/DINING 23'-6" x 13'-1" W/D M&E METER CLOSET OPT. PANTRY W/D. LIVING/DINING 23'-6" x 13'-1" ROOF TOP TERRACE AREA SQ. FT.
NTRY NTRY '-3" x 8'-0" '-3" x 8'-0" ###### x 8'-3" / 23'-" x 3'-" NTRY NTRY 3'-" x 7'-0" 9'-7" x 9'-7" '-0" x '-9" RKST NOOK 9'-0" x '-" 0 0 0 LVTIONS N TILS ON 9 SRIS. SHUL N TILS ON 9 SRIS. '-3" x 8'-0"
More informationd 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 informationBASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY
SI TIS SOWN OS TOP SPRIN INRS INNR W TS R OIN OVR S N OVR OR RIIITY. R IMNSIONS O INNR SIN TO UNTION WIT QU SM ORM-TOR (zqsp+) TRNSIVR. R. RR S OPTION (S T ON ST ) TURS US WIT OPTION T SINS. R (INSI TO
More informationCLKOUT CLKOUT VCC CLKOUT RESOUT OSCOUT ALE TEST AD0 66 AD2 INT0 INT0 AD INT1 AD INT2/INTA0 AD5 AD7 AD7 INT AD8 AD8 AD10
I U N R 00K RSIN* RST S N.0u Y LK TP RP K L TP USY INT0 INT RISMINT P.0 P. P. P. P. P. P. RY OL RX0 TX0 T P.0 P. P. P. S* S* S* S* RROR* SLK U LKIN LKOUT LKOUT LKIN LKOUT OSOUT 0 OSOUT L L RSIN* L 0 0
More information0.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 informationSolutions to Homework 5
Solutions to Homwork 5 Pro. Silvia Frnánz Disrt Mathmatis Math 53A, Fall 2008. [3.4 #] (a) Thr ar x olor hois or vrtx an x or ah o th othr thr vrtis. So th hromati polynomial is P (G, x) =x (x ) 3. ()
More informationPaths. 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 informationBASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP
MO: PSM SY SI TIS SOWN SPRIN INRS OS TOP INNR W TS R OIN OVR S N OVR OR RIIITY. R TURS US WIT OPTION T SINS. R (UNOMPRSS) RR S OPTION (S T ON ST ) IMNSIONS O INNR SIN TO UNTION WIT QU SM ORM-TOR (zqsp+)
More informationROSEMOUNT 3051SAM SCALABLE PRESSURE TRANSMITTER COPLANAR FLANGE PROCESS CONNECTION
ROSOUNT 3051S S PRSSUR TRNSITTR OPNR N PROSS ONNTION RVISION T RVISION O NO. PP' T RT1066757 N. STOS 10/21/2016 SRIPTION IN-IN V S PNTW OUSIN SOWN WIT OPTION IIT ISPY (PRIRY) PNTW OUSIN (PRIRY) RTIITION
More informationDETAIL B DETAIL A 7 8 APPLY PRODUCT ID LABEL SB838XXXX ADJ FOUR POST RACK SQUARE HOLE RAIL B REVISION
RVISION RV SRIPTION Y T HNG NO NOT OR PROUT LL JJH // LR TIL PPLY PROUT I LL TIL INSI UPPR ROSS MMR ON PR RK IS J OUR POST RK SQUR HOL RIL IS MN MS G NUT, PNL RNG 99 PPLY PROUT I LL INSI UPPR ROSS MMR
More information5/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 informationWhat do you know? Listen and find. Listen and circle. Listen and chant. Listen and say. Lesson 1. sheep. horse
Animls shp T h i nk Wht o you know? 2 2:29 Listn n fin. hors Wht s this? Wht s this? It s got ig nos. It s ig n gry. It s hors! YES! 2 Wht r ths? Wht r ths? Thy v got two lgs. Thy r smll n rown. Thy r
More informationCS 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 informationSEE PAGE 2 FOR BRUSH MOTOR WIRING SEE PAGE 3 FOR MANUFACTURER SPECIFIC BLDC MOTOR WIRING EXAMPLES EZ SERVO EZSV17 WIRING DIAGRAM FOR BLDC MOTOR
0V TO 0V SUPPLY GROUN +0V TO +0V RS85 ONVRTR 9 TO OM PORT ON P TO P OM PORT US 9600 U 8IT, NO PRITY, STOP, NO FLOW TRL. OPTO SNSOR # GROUN +0V TO +0V GROUN RS85 RS85 OPTO SNSOR # PHOTO TRNSISTOR TO OTHR
More informationExam 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 informationThe 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 information12. 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 informationPlanar 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 informationN1.1 Homework Answers
Camrig Essntials Mathmatis Cor 8 N. Homwork Answrs N. Homwork Answrs a i 6 ii i 0 ii 3 2 Any pairs of numrs whih satisfy th alulation. For xampl a 4 = 3 3 6 3 = 3 4 6 2 2 8 2 3 3 2 8 5 5 20 30 4 a 5 a
More informationDivided. 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 informationCMPS 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 informationBinomials and Pascal s Triangle
Binomils n Psl s Tringl Binomils n Psl s Tringl Curriulum R AC: 0, 0, 08 ACS: 00 www.mthltis.om Binomils n Psl s Tringl Bsis 0. Intif th prts of th polnomil: 8. (i) Th gr. Th gr is. (Sin is th highst
More informationTURFGRASS DISEASE RESEARCH REPORT J. M. Vargas, Jr. and R. Detweiler Department of Botany and Plant Pathology Michigan State University
I TURFGRASS DISEASE RESEARCH REPORT 9 J. M. Vrgs, Jr. n R. Dtwilr Dprtmnt f Btny n Plnt Pthlgy Mihign Stt Univrsity. Snw Ml Th 9 snw ml fungii vlutin trils wr nut t th Byn Highln Rsrt, Hrr Springs, Mihign
More informationMultipoint 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 informationProperties of Hexagonal Tile local and XYZ-local Series
1 Proprtis o Hxgonl Til lol n XYZ-lol Sris Jy Arhm 1, Anith P. 2, Drsnmik K. S. 3 1 Dprtmnt o Bsi Sin n Humnitis, Rjgiri Shool o Enginring n, Thnology, Kkkn, Ernkulm, Krl, Ini. jyjos1977@gmil.om 2 Dprtmnt
More informationV={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 informationT 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 informationV={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 informationOpenMx 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 informationCSE 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 informationEXAMPLE 87.5" APPROVAL SHEET APPROVED BY /150HP DUAL VFD CONTROL ASSEMBLY CUSTOMER NAME: CAL POLY SLO FINISH: F 20
XMPL XMPL RVISIONS ZON RV. SRIPTION T PPROV 0.00 THIS IS N PPROVL RWING OR YOUR ORR. OR MNUTURING N GIN, THIS RWING MUST SIGN N RTURN TO MOTION INUSTRIS. NY HNGS M TO THIS RWING, TR MNUTURING HS GUN WILL
More informationNefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim
MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07
More informationSOCKET WELD OR THREADED BODY TYPE (3051SFP FLOWMETER SHOWN THROUGHOUT / 3051CFP, 2051CFP AVAILABLE)
9 10 12 13 14 15 16 RVISION T RVISION O NO. PP' T SI1053953 3/30/17 03/31/17 SRIPTION NOT 10 N RIITION ON ST 10. T 1 - OY INSIONS 2X 1/4" NPT VNT VVS INSIONS IN SIZ 3.4 [86.0] 3.8 [97.0] 4.5 [4.0] 4.7
More informationIn 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 informationP a g e 5 1 of R e p o r t P B 4 / 0 9
P a g e 5 1 of R e p o r t P B 4 / 0 9 J A R T a l s o c o n c l u d e d t h a t a l t h o u g h t h e i n t e n t o f N e l s o n s r e h a b i l i t a t i o n p l a n i s t o e n h a n c e c o n n e
More informationGraph 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 informationDEVELOPING 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 informationCSE 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 informationMCB137: Physical Biology of the Cell Spring 2017 Homework 6: Ligand binding and the MWC model of allostery (Due 3/23/17)
MCB37: Physical Biology of th Cll Spring 207 Homwork 6: Ligand binding and th MWC modl of allostry (Du 3/23/7) Hrnan G. Garcia March 2, 207 Simpl rprssion In class, w drivd a mathmatical modl of how simpl
More informationC-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 informationCompression. Compression. Compression. This part of the course... Ifi, UiO Norsk Regnesentral Vårsemester 2005 Wolfgang Leister
Kurs INF5080 Ifi, UiO Norsk Rgnsntrl Vårsmstr 2005 Wolfgng Listr This prt of th ours...... is hl t Ifi, UiO... (Wolfgng Listr) n t ontins mtril from Univrsity Collg Krlsruh (Ptr Ol, Clmns Knorzr) Informtion
More informationMath 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 informationPupil / Class Record We can assume a word has been learned when it has been either tested or used correctly at least three times.
2 Pupi / Css Rr W ssum wr hs b r wh i hs b ihr s r us rry s hr ims. Nm: D Bu: fr i bus brhr u firs hf hp hm s uh i iv iv my my mr muh m w ih w Tik r pp push pu sh shu sisr s sm h h hir hr hs im k w vry
More informationModule 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 informationGarnir 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 informationMath 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 informationLecture 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 informationOutline. 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 informationCSE303 - 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 informationCS200: 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 informationDOI: 10.1038/n3296 Supplmntry Figur 1 PN2 PN5 Exprssion o Tt trnsripts uring mryos vlopmnt. x3 x7 x9 x4 2lls 4lls Blstoyst 5C 5C 5C 5C x3 x1 x4 Mrg (5C/5C, PI) x6 x9 x8 x10 100 ng ntioy C ntioy C 200ng
More informationminimize c'x subject to subject to subject to
z ' sut to ' M ' M N uostrd N z ' sut to ' z ' sut to ' sl vrls vtor of : vrls surplus vtor of : uostrd s s s s s s z sut to whr : ut ost of :out of : out of ( ' gr of h food ( utrt : rqurt for h utrt
More informationHaving 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 information4.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 informationTHE EFFECT OF SEED AND SOIL APPLIED SYSTEMIC INSECTICIDES ON APHIDS IN SORGHUM. Texas Agricultural Experiment Station, Nueces County, 2000
THE EFFECT OF SEED AND SOIL APPLIED SYSTEMIC INSECTICIDES ON APHIDS IN SORGHUM Txs Agriulturl Exprimnt Sttion, Nus County, 2000 Roy D. Prkr Extnsion Entomologist Corpus Cristi, Txs SUMMARY: Grnug, yllow
More informationConstruction 11: Book I, Proposition 42
Th Visul Construtions of Euli Constrution #11 73 Constrution 11: Book I, Proposition 42 To onstrut, in givn rtilinl ngl, prlllogrm qul to givn tringl. Not: Equl hr mns qul in r. 74 Constrution # 11 Th
More information