reinforcement learning information access real learning problem information access rich sutton university massachusetts rich cs umass presented aaai stanford spring symposium machine learning information access march 26 1996 rik belew jude shavlik introductory talk learning problem information access structured training information delays decision making receipt relevant feedback newcomer information access experience reinforcement learning main lessons reinforcement learning important understand true nature learning problem solve illustrates idea 1989 gerry tesauro ibm built world computer player backgammon neural network trained 15 000 examples human expert moves reinforcement learning approach trained network expert examples simply playing observing outcomes month play program world champ computers extremely strong player par world learning play approach worked primarily generate training data expert trained network limited 15 000 examples constructed human experts play training data individually informative generated cheaply big win long run true information access training sets documents labeled experts relevant relevant training data expensive scarce small generate kind training data online normal system data imperfect unclear plentiful important sense expert labeled training sets artificial accurately mirror real usage backgammon expert trained system learn mimic experts win game online trained system learn play experts training data real challenge information access uncover real structure learning problem learning online learning data data data data online normal operation system relying expensive expert labeled training sets talk proceeds parts introduction reinforcement learning examines parts learning problem information access solved reinforcement learning methods information access problem doesn map reinforcement learning problem special structure part talk examine special structure kind learning methods applied rest approximations slides presented talk conclusions advance learning ia information access learning told answers sequential problem actions affect opportunities reinforcement learning addresses issues learning powerful online normal operation online data feedback ia reinforcement learning learning trial error rewards punishments active multidisciplinary research area approach ai based learning interaction environment integrates learning planning reacting handles stochastic uncertain environments recent large scale world class applications learning mechanisms learning helpful feedback classical machine learning supervised learning correct correct correct action supplied objective correct actual actions effect interaction independent contained reinforcement learning agent told action correct agent told actions selected actions affect situation object maximize future rewards harder problem real problem problems relevance feedback documents shown exploration exploitation dilemma degrees relevance don make user happy short term solutions require sequences steps support early steps sl reliably line prediction learn normal operation applications rl td gammon tesauro dahl elevator control crites job shop scheduling zhang dietterich mobile robot controllers lin miller computer vision peng al natural language dialog tuning characters interactive games lane airline seat allocation hutchinson manufacturing composite materials white key ideas rl algorithms functions heuristic state evaluation function learned approximates expected future reward state action idea learn good action taking account long term affects functions vastly simplify td methods efficient learning predict functions experience search learning guess guess large space rl algorithms major components rl agent policy reward good good predicts reward model info access applications rl anytime decisions made desired choice immediately clear anytime make long term predictions classical ir querying routing filtering rl situation query user model documents actions present document rankings reward user feedback presented docs pro rl feedback selective fit sl framework con rl feedback fit rl framework problem sequential bartell cottrell belew 1995 freitag 1996 sch hull 1995 multistep info access problems query search optimization entertainment software ir agents information assistant routing filtering interface manager web browsing anticipating user sense learning complex interactive goal directed input sensitive sequence steps rl good multi step sequential nature ia web page led web page request user enabled query query results enabled user refine query ordering search steps document turned series searches building prior results imagine ideal info access system continuous oportunity provide query info keywords type specs feedback continuously updated list proposed documents find good actions things pursue search send queries alta vista yahoo user synonyms types utilities documents propose links follow consult situations current status search reward good bad buttons maintaining interest good action rewards lead feedback good bad desired response situation sequence prior situations good document positive negative wasn found earlier result search generalized learned anticipated anticipation process similar rl processes compare classical context large numbers documents 2 million queries 200 queries learn docs web large numbers documents queries readings writings learn docs good good keywords popularity ratings documents decide access today scientific papers books movies web pages recommendations reviewed journals movie critics cool site day visitors site colleagues talking hard find good stuff web classical ir concept good stuff docs relevant good bad differences similarities users users provide feedback favor paid program forces providing feedback selfish reasons suppose personal research assistant wouldn didn user differences selfish feedback user similarities summary data power relevant data relevance utility independent multi step queries collaborative filtering selfish feedback learning classifications


ismap computer science courses concentration courses 100 computers arts sciences 150 computer modeling tool mind introductory courses 101 introduction computing 102 introduction computing ii intermediate courses 201 computer organization 202 introduction symbolic programming 290 discrete structures 303 principles design large systems 304 theory computing advanced courses 420 programming languages 425 compiler design 430 artificial intelligence 435 computer graphics 440 operating systems seminar 445 parallel computing 450 advanced theory seminar 460 analysis algorithms 480 topics computer science 491 independent study courses math 111 calculus phys 182 digital electronics img http cs colgate csdept courses html revised april 11 1996 questions knolan cs colgate


1027 photos de vous la bienvenue la jessica les photos 3e deja de pas encore la ana maria le herve alexandre back button back home page jamrozik cs washington v1 1 mai 6 1996 v1 0 april 19 1996


cs354 fall 1996 homework 1 due wednesday september 18 1 10 points 1 point note complete sal instruction set appendix textbook page 386 variables sal programs global sal statement works types label variable sal program reserved word variables declared sal programs data section text section source code executed sal statement ret branch sal statement labeled ret context ret variable statement label executed sal statement ret branch sal statement labeled ret ret statement label sal program start label part sal instruction set macro rem put remark comment sal program type declarations made sal programs type checking assembler type defs reserve space 2 2 points single sentence explain computer architecture means context cs354 computer architecture defined basic instruction set computer 3 8 points translate code equivalent sal statements assume variables type int 0 1 5 bgtz 0 part beq 1 1 part add 1 part div rem cont jump part mul 5 part add solution mul 5 add cont beq 1 add 1 div rem cont


1859 originally milwaukee wisconsin milwaukee claim fame lies bars capita nation suppose surprising city attended university wisconsin madison undergraduate double majored computer science economics math emphasis decided years torture weren graduate student computer science attending madison decision stay madison brutal wisconsin winters ah california summer internship intel corporation hillsboro oregon back madison finish master computer science previous main index modified october 17 1996 22 29 img moy cs wisc copyright 1996 tony moy


frame header frame contents frame home


cse370 feedback form feedback important helps improve form send feedback make feedback anonymous type anonymous user id leave password blank tracking mail user id enter subject enter comments feedback instructor ta instructor ta web master submit comments press button submit comments clear form press button clear form comments cse370 webmaster cs washington update 09 30 96


removal tracked objects digital video alfred hong heji kim lin hsian wang department computer science 324 upson hall cornell university ithaca ny 14853 7501 http www cs cornell info projects zeno rivl rivl html table contents 1 introduction 2 background information 3 specifics 3 1 object tracking hausdorff tracker 3 2 background reconstruction 3 3 object segmentation 4 evaluation 5 related work extensions 6 references 1 introduction object tracking sequence images provide base multitude digital video processing applications removal object scene numerous video processing editors object tracking removal manual process existing object tracking feature rivl implement semi automated application user remove object reconstruct background result video sequence work primarily focuses algorithms domain stationary backgrounds single moving object addition extend work segment tracked object background resulting segmentation variety video processing effects tracked object top sequence resulting application ideal test bed experimenting segmentation algorithms reconstruct background techniques segmentation illustrated diagram figure 1 segmentation overview rest paper organized section 2 background rivl hausdorff tracking algorithm section 3 discusses vision algorithms employed ends section 4 reviews work section 5 concludes current status future research directions key words object tracking hausdorff distance object removal segmentation background reconstruction image filtering table contents 2 background information rivl rivl resolution independent video language video audio class data types jonathan schwartz implemented rivl tcl tk extension multimedia processing high level operators rivl independent video format resolution infrastructure test ideas rivl rivl generates code rivl functions perform low level image processing routines included rivl library implementations median filters functions generated rivl pixel level computations hausdorff tracker hausdorff tracker feature based object tracking system continuous sequence images model tracked object represented binary edge map produced applying canny edge operator smoothed version gray level image input image taking advantage fact motion object roughly affine transformation consecutive frames algorithm matches translations scales model search window shown red dotted box figure 2 generally match points overlap transformation model match model image tracker begins wander results quickly figure 2 hausdorff tracking algorithm explained background information table contents 3 specifics section discusses implementation algorithms accessible editor subsection discusses object tracking subsection discusses background reconstruction algorithms assuming stationary camera subsection discusses segmentation algorithms 3 1 object tracking hausdorff tracker tracker rivl returns scale translation coordinates image performance tracker depends setting correct parameters search size search window scaling factors forward backward distance limits allowed match make trade constraints processing time required track object hausdorff tracker works larger images background information 3 2 background reconstruction background replace tracked object original sequence possibly segment object experiment approaches background reconstruction temporal median filter temporal filter physical space search approaches background reconstruction temporal filter temporal median filter temporal filter technique computes pixel taking arithmetic average frame sequence assigns result pixels background frame technique averages tracked object scene blurring effect implement filter averaging rgb values independently temporal median filter builds background frame computing median pixel sorting images video sequence techniques relies assumption portion tracked object appears location half image frames implement filter finding frame median gray level reconstructing background rgb values temporal filters pixel level operations wrote rivl rivl twenty frames maximum entered input function medians medians median implement true median function entire video sequence compute median samples sample composing twenty frames set equal intervals user decide result physical space search physical space search finds frame bounding box tracked object overlap processed frame part background needed replace object occupied object previous frames assumptions motion continuity initially search background current image frame found background previous frame avoid comprehensive search initial frame search entire sequence background replacements prefer closest frame background find multiple scenes background resides case moving object moved background partition bounding box smaller blocks search background pieces assume single moving object sequence frame object removed background reconstructed background entire sequence due shifting lighting levels desirable reconstruct scene frame block frames figure 3 shows result background covered subject head figure 3 sequence illustrating object tracking background reconstruction 3 3 object segmentation image segmentation segmentation separating tracked object background core problems vision adequately solved unconstrained settings explore motion differencing differencing background subtraction classical problem figure 4 segmentation methods image differencing motion differencing applies threshold consecutive images produce binary image indicating regions motion extend motion differencing consecutive frames differencing perform binary operation difference image frames frames segment moving object middle frame moving objects segmented exists overlap moving object consecutive images choose consecutive frames sufficient motion figure 4 segmentation methods background subtraction background subtraction involves application threshold background image moving object techniques works faithful copy background table contents 4 evaluation figure 5 input video sequence video sequence 200 frames inputs test images recorded motion sun microsystems camera parallax board img img median figure 6 temporal filter results images results temporal filters reconstructed background image filter slightly visible blurring effect caused moving object number frames video increases effect negligible process filter smoothing function function rid shadowing effect figure 4 segmentation results background subtraction choose test metric commonly vision researchers determine quality segmentation background subtraction produced segmentation smoothest edges number holes object motion differencing performed worst give irregular outline motion includes portion background belongs object previous image current image effect appears undesirable white outline object pair images differencing method shows improved results regular motion differencing solid background subtraction differencing advantage background subtraction reconstructing background sort post filtering cases fill holes smooth edges figure 5 segmentation results differencing motion differencing set fold goal object removal object segmentation quality object removal depends accuracy hausdorff tracker fidelity reconstructed background feel accomplished long background exist success segmentation leave room future improvements table contents 5 related work extensions multimedia vision highly experimental areas numerous possibilities tracking object segmentation active research vision appears virtually established work automating object removal background reconstruction extend project orthogonal directions solve object removal moving camera handle pans handle subtle problems object removal object shadow reflection integrate full video editor include functionalities allowing tracker backtrack reset object position refine segmentation morphological operators table contents 6 references 1 tracking rigid objects complex scenes proceedings fourth international conference computer vision 1993 93 101 rucklidge 2 jain kasturi schunck machine vision mcgraw hill 1995 3 ousterhout john tcl tk toolkit addison wesley massachusetts 1994 4 swartz jonathan smith brian rivl resolution independent video language submitted 1995 tcl tk workshop july 1995 toronto ca 5 bender salient video stills content context preserved proc acm multimedia 1993 pp 39 46 table contents


280 logic design digital systems information electronics workbench general hints accessing smith lab links official lit instructions accessing alternative methods running windows 95 alternative method running windows 3 1 bad news macintosh users link back 280 home page joan carletta carletta ces cwru


introduction computer graphics 1996 autumn quarter project sessions project 0 session introduction opengl libui make home page project 1 session project 2 session project 3 sessions start toy story


cs ece 752 advanced computer architecture prof mark hill jeff shabel due thurs oct 10 pertains chapter 5 text hennessy patterson computer architecture quantitative approach edition 1996 work late assignments accepted problem ii 1 8 points trace driven cache simulator dinero examine direct mapped 16k byte unified cache 16 byte blocks default cache options trace fragment spec92 gcc info read dinero man readme files directory cs752 markhill public software dinero copy trace file 4mb test runs 50k references waiting full simulation results trace fragment miss ratio direct mapped 16k byte unified cache 16 byte blocks effective access time assuming 5 0 ns access cache 100 0 ns miss penalty assumptions part change block size 32 bytes miss ratio larger block size hurt miss penalty miss penalty cache effective access time cache part round answer nearest 0 ignore cycle time boundaries assumptions part change associativity 2 miss ratio larger associativity hurt time access cache cache access time 2 cache effective access time cache part round answer nearest 0 1 ns ignore cycle time boundaries trace fragment begins true contents cache part unknown maximum relative error miss ratio caused lack knowledge explain answer problem ii 2 6 points problem 5 14 part plot miss ratios direct mapped fully associative instruction cache block size 32 bytes spec92 gcc problem 1 vary cache size 64 bytes 4k bytes plot sets data graph highlight point cache stops consistently exhibiting behavior book


img publications img img page retrieve papers reports img thesis produced members visitors horus project img papers horus related issues start 1993 earlier papers img consult isis papers img retrieval methods entry list icons abstract paper found horus abstracts page postscript version retrieved cornell cs ftp server document retrieved forms cornell cs technical report server paper line html document selecting icon retrieve document case postscript bring page view document selected form horus architecture protocols performance kenneth birman robbert van renesse software reliable networks scientific american 1996 img img robbert van renesse kenneth birman silvano maffeis horus flexible group communication system communications acm april 1996 img img robbert van renesse masking overhead protocol layering proceeding 1996 acm sigcomm conference stanford september 1996 img roy friedman ken birman group communication technology implement reliable scalable distributed coprocessor proceedings tina 96 heidelberg september 1996 img img werner vogels world wide failures proceedings acm sigops 1996 european workshop connamoran ireland september 1996 img img robbert van renesse kenneth birman roy friedman mark hayden david karr framework protocol composition horus proceedings principles distributed computing august 1995 img img roy friedman robbert van renesse strong weak virtual synchrony horus cornell university technical report tr95 august 1995 img img roy friedman robbert van renesse packing messages tool boosting performance total ordering protocols cornell university technical report tr95 1527 august 1995 img img robbert van renesse kenneth birman protocol composition horus cornell university technical report tr95 march 1995 img img robbert van renesse kenneth birman bradford glade katie guo mark hayden takako hickey dalia malki alex vaysburd werner vogels horus flexible group communications system cornell university technical report tr95 1500 march 1995 img img takako hickey robbert van renesse incorporating system resource information flow control cornell university technical report tr95 1489 february 1995 img img robbert van renesse takako hickey kenneth birman design performance horus lightweight group communications system cornell university technical report tr94 1442 august 1994 img img werner vogels robbert van renesse support complex multi media applications horus system december 1994 img img horus security david cooper kenneth birman preserving privacy network mobile computers cornell university technical report tr95 1490 march 1995 img img michael reiter kenneth birman robbert van renesse security architecture fault tolerant systems cornell university technical report tr93 1354 june 1993 img img virtual synchrony partitions protocols roy friedman ken birman trading consistency availability distributed systems cornell university technical report tr95 1579 april 1996 img img roy friedman keidar dalia malki ken birman danny dolev deciding partitionable networks cornell university technical report tr95 1554 november 1995 img img roy friedman virtual synchrony develop efficient fault tolerant distributed shared memories cornell university technical report tr95 1506 march 1995 img img mark hayden kenneth birman achieving critical reliability unreliable components unreliable glue cornell university technical report tr95 march 1995 img img dalia malki kenneth birman aleta ricciardi andre schiper uniform actions asynchronous distributed systems cornell university technical report tr94 september 1994 img img aleta ricciardi andre schiper kenneth birman understanding partitions partition assumption cornell university technical report tr93 1355 june 1993 img img andre schiper aleta ricciardi virtually synchronous communication based weak failure cornell university technical report tr93 1339 april 1993 img img aleta ricciardi kenneth birman process membership asynchronous environments cornell university technical report tr93 1328 march 1995 img img comments werner vogels


papers michael ferris ferris pang editors complementarity variational problems state art philadelphia pennsylvania 1996 siam ferris linear convergence successive linear programming algorithm technical report computer sciences department university wisconsin madison wisconsin 1996 anderson ferris direct search algorithm optimization noisy function evaluations technical report computer sciences department university wisconsin madison wisconsin 1996 ferris mor neos system complementarity problems path mathematical programming technical report 96 08 computer sciences department university wisconsin madison wisconsin 1996 mcs mathematics computer science division argonne national laboratory tin ferris analysis fracture nonlinear ninth international conference fracture april 1 5 1997 1997 accepted publication proceedings ferris crash techniques large scale complementarity problems ferris pang editors complementarity variational problems state art philadelphia pennsylvania 1996 siam ferris comparison large scale mixed complementarity problem solvers computational optimization applications forthcoming 1996 ferris mangasarian breast cancer diagnosis linear programming ieee computational science engineering 2 70 71 1995 ferris rutherford permits costs emission restrictions results general equilibrium model eu countries economic aspects environmental policy making federal system 1995 ferris rutherford accessing realistic complementarity problems matlab editors proceedings nonlinear optimization applications workshop june 1995 york 1996 plenum press ferris quadratic program based solver mixed complementarity problems mathematical programming forthcoming 1996 ferris pang engineering economic applications complementarity problems discussion papers economics 95 7 department economics university colorado boulder colorado 1995 ferris rutherford computing equilibrium complementarity framework mathematical programming technical report 95 03 computer sciences department university wisconsin madison wisconsin 1995 ferris operator splitting methods monotone affine variational inequalities parallel application optimal control mathematical programming technical report 94 17 computer sciences department university wisconsin madison wisconsin 1994 ferris roma nonmonotone stabilization techniques unconstrained optimization computational optimization applications 6 117 136 1996 ferris solutions affine generalized equations proximal mappings mathematical programming technical report 94 15 computer sciences department university wisconsin madison wisconsin 1994 ferris ralph projected gradient methods nonlinear complementarity problems normal maps editors recent advances nonsmooth optimization pages 57 87 world scientific publishers 1995 ferris horn partitioning mathematical programs parallel solution technical report 1232 computer sciences department university wisconsin madison wisconsin 1994 ferris newton method computing general equilibria annals operations research forthcoming 1996 cao ferris removal normal maps communications applied nonlinear analysis 2 1 10 1995 cao ferris matrices linear complementarity problem linear algebra applications 246 299 312 1996 ferris mcplib collection nonlinear mixed complementarity problems optimization methods software 5 319 345 1995 ferris pang solutions related concepts affine variational inequalities siam journal control optimization 34 244 263 1996 ferris convergence interior point algorithm arbitrary positive starting points siam journal optimization 6 316 325 1996 ferris path solver monotone stabilization scheme mixed complementarity problems optimization methods software 5 123 156 1995 burke ferris gauss newton method convex composite optimization mathematical programming 71 179 194 1995 ferris mangasarian parallel variable distribution siam journal optimization 4 815 832 1994 ferris nonmonotone stabilization methods nonlinear equations journal optimization theory applications 81 53 71 1994 cao ferris pivotal method affine variational inequalities mathematics operations research 21 44 64 1996 cao ferris interior point algorithm monotone affine variational inequalities journal optimization theory applications 83 269 283 1994 ferris linear complementarity problem bulletin american mathematical society 28 169 175 1993 ferris operator splitting methods monotone linear complementarity problems tmc 239 thinking machines corporation cambridge ma 02142 1992 ferris rutherford gams program library variational complementarity solvers mathematical programming technical report 94 07 computer sciences department university wisconsin madison wisconsin 1994 ferris mangasarian error bounds strong upper monotone affine variational inequalities annals operations research 47 293 305 1993 burke ferris weak sharp minima mathematical programming siam journal control optimization 31 1340 1359 1993 anderson ferris genetic algorithms combinatorial optimization assembly line balancing problem orsa journal computing 6 161 173 1994 ferris globally convergent methods nonlinear equations technical report 1030 computer sciences department university wisconsin madison wisconsin 1991 ferris parallel constraint distribution convex quadratic programs mathematics operations research 19 645 658 1994 bennett ferris ioannidis genetic algorithm database query optimization belew editors proceedings fourth international conference genetic algorithms pages 400 407 san mateo california 1991 morgan kaufmann publishers ferris mangasarian parallel constraint distribution siam journal optimization 1 487 500 1991 cao ferris genetic algorithms optimization journal undergraduate mathematics applications 12 81 90 1991 burke ferris qian clarke distance function closed set journal mathematical analysis applications 166 199 213 1992 ferris affine scaling semi infinite programming mathematical programming 56 361 364 1992 anderson ferris genetic algorithm assembly line balancing problem proceedings integer programming combinatorial optimization conference waterloo ontario canada 28 30 university waterloo press 1990 ferris scheduling penalties naval research logistics quarterly 39 229 245 1992 anderson ferris parallel genetic algorithms optimization proceedings fourth siam conference parallel processing scientific computing chicago illinois december 11 13 1989 ferris mangasarian minimum principle sufficiency mathematical programming 57 1 14 1992 burke ferris characterization solution sets convex programs operations research letters 10 57 60 1991 ferris parallel solution extremely large knapsack problems technical report 842 computer sciences department university wisconsin madison wisconsin 1989 ferris mangasarian finite perturbation convex programs applied mathematics optimization 23 263 273 1991 ferris iterative linear programming solution convex programs journal optimization theory applications 65 53 65 1990 ferris finite termination proximal point algorithm mathematical programming 50 359 366 1991 ferris weak sharp minima penalty functions mathematical programming technical report 779 computer sciences department university wisconsin madison wisconsin 1988 ferris interior point algorithm semi infinite linear programming mathematical programming 43 257 276 1989 ferris performance algorithm journal operational research society 39 257 270 1988 ferris weak sharp minima penalty functions mathematical programming phd thesis university cambridge england 1988 ferris linear programming minimum weight design comparison methods solving class structural optimization problems master thesis university cambridge england 1985


college engineering university wisconsin madison coe website site index site navigation tips frequently asked questions contact webmaster information site independent webmasters information site pages wishing link www workshop faculty staff 100 creating personal homepage uw coe depts centers consortia services fountain index search mail credits modified wednesday 20 nov 96 11 30 35 cst page viewed browsers support background colors coe tables photographs 1996 college engineering address comments webmaster engr wisc


university minnesota computer science institute technology ftp server www front end major construction pardon mess index dept departmental directories pub miscellaneous archives packages larger mirrored packages users user archives


ece cs 552 introduction computer architecture fall 1996 97 tentative outline denotes additional material account ece552 thu sep 5 16 40 17 cdt 1996


img program 2 marathon friday 4 19 96 8 50 grade 25 final grade text covered chp 1 2 3 4 background june 22 gallant cs 110 instructor running marathon annual grandma marathon duluth minnesota familiar marathon ancient greece 490 bc soldier ran town marathon athens bring news greek victory news important ran entire distance stop taking time stopping celebrate odd wine topic historical debate marathon athens distance 25 miles modern distance 26 miles 385 yards 26 2 miles established 1908 london olympics represents distance royal castle windsor olympic stadium marathon considered highlight final track field event summer olympic games men women records event problem description hired grandma marathon organizing committee write computer software processing finishing times year event finish line finishing time runner entered computer program read values runners compute statistics race including fastest times program prompt user enter total number runners marathon prompt enter finishing time runner entered line shown hours minutes seconds 5 ima 7 55 24 3 8 16 hillary clinton 4 11 45 clark kent 1 5 10 gareth bestor 3 36 2 notes entered character string surrounded single quotes 20 characters long finishing time entered integers separated spaces runners entered order entered ascending descending order finishing times runners program read data compute statistics 1 total number runners 2 place runner 3 place runner 4 average finishing time displayed hours minutes seconds format 5 standard deviation finishing times displayed hours minutes seconds format 6 average pace measured minutes mile displayed minutes seconds format race data program display hint check results total number runners 5 place clark kent place average finishing time 3 59 19 standard deviation 2 29 28 average pace 9 8 minute mile don worry extra spaces output shown optional exercise formatted output chapter 5 remove spaces calculations calculations convert finishing times hours minutes seconds format total number seconds displaying results average finishing time standard deviation average pace convert total number seconds back hours minutes seconds hint find mod function converting total number seconds hours minutes seconds results integers rounded nearest determine place winners remember lowest lowest finishing times total number seconds names time read runner check time values assign compute average finishing time add finishing times total number seconds compute standard deviation add finishing time values squared obtained sums formulae compute standard deviation total number runners compute standard deviation total number seconds displayed hours minutes seconds format integers rounded nearest runners typically measure pace minutes mile minute mile average number minutes takes run mile formula compute average pace pace displayed minutes seconds format integers rounded nearest hand hand assignment online copying fortran source code file program2 compiled executable file program2 exe handin directory hand printed copy fortran source code file printed copy output program run sets test data gradesheet gradesheet gradesheet grade assignment close make required note graded correct output sets input values handing run program values manually check program correct results cases enter runner order correct output 20 5 4 julie lewis 4 12 19 john wiley 2 18 55 gareth bestor 3 36 2 barbara 3 41 9 diane meyers 2 33 17 3 4 julie lewis 4 12 19 barbara 3 41 9 john wiley 2 18 55 3 4 john wiley 2 18 55 barbara 3 41 9 julie lewis 4 12 19 5 4 julie lewis 5 12 19 john wiley 3 18 55 gareth bestor 4 36 2 barbara 4 41 9 diane meyers 3 33 17 5 4 diane meyers 2 55 34 john wiley 3 53 9 barbara 4 24 38 julie lewis 2 22 46 gareth bestor 3 36 2 user interface 6 prompts total number runners data runner 2 meaningful display results 4 implementation 16 correct implementation formulas 4 correct end statement 4 correct end loop 4 meaningful variable names 2 indenting neatness 2 documentation 8 program description 4 variable definitions section comments 4 total 25 50 copyright 1996 gareth bestor bestor cs wisc modified april 7 1996


data files condensation data data numbers decimal format table condensation air 48 12 00 29 2 16 29 2 16 46 11 1 2 01 7 16 30 9 16 30 6 16 44 11 02 13 16 31 15 16 31 12 16 42 10 1 2 04 6 16 33 8 16 33 1 7 40 10 06 3 16 35 5 16 35 38 9 1 2 07 14 16 37 36 15 19 36 9 10 2 16 39 5 16 38 7 8 34 8 1 2 12 8 16 41 10 16 41 2 17 32 8 15 1 16 44 3 16 43 11 16 30 7 1 2 17 15 16 47 1 16 46 3 5 28 7 21 3 16 50 5 16 50 26 6 1 2 25 3 16 54 5 16 53 10 13 24 6 29 11 16 58 13 16 58 2 8 23 5 3 4 32 3 16 61 5 16 60 18 23 22 5 1 2 34 15 16 64 1 16 63 6 11 21 5 1 4 37 15 16 67 1 16 66 4 7 20 5 41 9 16 70 11 16 70 19 4 3 4 45 74 2 16 73 11 19 18 4 1 2 48 12 16 77 14 16 77 2 3 17 4 1 4 53 11 16 82 12 16 82 4 17 16 4 58 2 16 87 14 16 87 3 8 15 3 3 4 63 15 16 93 1 16 93 1 5 14 3 1 2 71 5 16 100 7 16 99 6 7 13 3 1 4 78 11 16 107 13 16 107 7 13 12 3 88 7 16 117 9 16 116 4 8 table air 1 00 29 3 4 29 3 4 1 1 2 10 5 8 19 1 8 19 5 6 2 15 3 8 14 3 8 14 7 8 3 20 2 8 9 4 8 9 15 12 4 22 5 8 7 1 8 7 7 16 5 24 1 8 5 5 8 5 19 25 6 24 7 8 4 7 8 4 23 24 7 25 4 8 4 2 8 4 1 4 8 26 3 6 8 3 23 32 9 26 3 8 3 3 8 3 11 36 10 26 6 8 3 2 39 40 12 27 1 8 2 5 8 2 23 48 14 27 4 8 2 2 8 2 1 8 16 27 6 8 2 1 55 64 18 27 7 8 1 7 8 1 47 72 20 28 1 6 8 1 9 80 24 28 2 8 1 4 8 1 23 96 28 28 3 8 1 3 8 1 1 16 32 28 4 8 1 2 8 119 128


3313 water song sung stream feet high places hannah lower lower day joy race find lowest place law happy low urge lower hear night day calling heights leap flow valleys answering call lowest place urge pain low rise george forman gforman hpl hp home page mail finger map weather cs dept uw live picture generated wed oct 2 11 18 37 pdt 1996


lecture overheads autumn 1996 lecture 01 monday september 30 lecture 02 wednesday october 2 lecture 03 friday october 4 lecture 04 monday october 7 lecture 05 wednesday october 9 lecture 06 friday october 11 lecture 07 monday october 14 lecture 08 wednesday october 16 lecture 09 friday october 18 lecture 10 monday october 21 lecture 11 wednesday october 23 lecture 12 friday october 25 lecture 13 monday october 28 lecture 14 wednesday october 30 lecture 15 friday november 1 lecture 16 wednesday november 6 lecture 17 friday november 8 lecture 18 wednesday november 13 lecture 19 friday november 15 lecture 20 monday november 18 lecture 21 wednesday november 20 lecture 22 friday november 22 lecture 23 monday november 25 lecture 24 wednesday november 27 lecture 25 monday november 2 lecture 26 wednesday november 4 lecture 27 friday november 6 lecture 28 monday november 9 lecture 29 wednesday november 11 jari cs washington


real jeff lampert stand left oct 94 96 add clean comparison grow week confuse people occasionally side haven halloween speaking jeff bottom feature designed spring break years back set start screen turned monitor upside mention names mika pic jeff 1996 pic jeff oct 1994 jeff pic tick cs wisc


1124 department computer science engineering steve hanks steve hanks associate professor received degree math davis 1978 business school earning mba decision sciences mse computer science university pennsylvania finding life investment banker entered yale computer science department study artificial intelligence received ph 1990 research interests include automated planning decision making uncertainty temporal reasoning logic representation language ai academic include sports tennis cooking 19th century music finger information hanks cs washington back steve home page


projects marc langheinrich projects sample projects worked working homepage finder shortly arrival university washington joined jonathan shakes homepage finder project set web service user easily find homepages world wide web check current progress http www cs washington research ahoy therapy module 3rd 4th year university bielefeld worked project order build rule based therapy module ongoing research project system implementation language knowledge shell knowledge craft carnegie group university bielefeld library web server 1995 set web server university library including hardware software os selection installation maintainance creation library web html pages maintained large group people departments find editorial page http www ub uni bielefeld de home htm editorial page marc langheinrich university washington department computer science email marclang cs washington www http www cs washington homes marclang


boston university cas computer science dept cas cs 101 b1 introduction computers homework archive assignment 0 due date 7 2 96 assignment 1 due date 7 15 96 assignment 2 due date 7 24 96 assignment 3 due date 7 31 96 assignment 4 due date 8 7 96 10 points extra credit due date 8 5 96 created july 2 1996 updated july 31 1996


3221 cse engr 142 autumn 1996 week week lecture schedule subject revision week monday wednesday friday sept 30 overview oct 4 expressions 1 ch 1 oct 2 variables ch 2 types ch 2 hw 0 hw 1 oct 7 simple oct 9 style ch 2 oct 11 simple 2 input output ch functions ch 3 2 conditionals part 1 ch 4 hw 1 due hw 2 oct 16 oct 18 oct 14 functions ch 3 conditionals 3 functions continued ch ch 3 conditionals part 2 4 ch 4 hw 2 due hw 3 oct 21 oct 25 iteration 4 conditionals oct 23 iteration continued ch conclusion ch ch 5 5 4 oct 28 iteration nov 1 5 continued ch oct 30 functions 5 hw 3 due hw 4 ch 6 midterm exam nov 8 functions nov 4 functions nov 6 functions output output output parameters 6 parameters parameters continued ch continued ch continued ch 6 6 6 hw 4 due hw 5 nov 11 class nov 13 arrays ch nov 15 arrays 7 veterans day 8 continued ch holiday 8 nov 22 structs nov 18 arrays nov 20 ch 11 8 continued ch dimensional 8 arrays ch 8 hw 5 due hw 6 nov 25 structs nov 27 sorting ch nov 29 class 9 ch 11 8 thanksgiving recess 10 dec 2 strings dec 4 arrays dec 6 file ch 9 structs ch 11 ch 12 dec 9 recursion dec 11 day 11 ch 10 instruction special topics hw 6 due review final exam note date tuesday times change december 17 12 published time 142a 10 30 12 20 place location kane 120 142b 12 30 2 20 original final exam times 142a 8 30 10 20 tuesday december 17 142b 2 30 4 20 tuesday december 17


chinook version june 1994 click block diagram tools vp vp verilog parser takes verilog file splits parts structural description extracted passed port allocator behavioral description concurrent time driven event driven code translated output compiler ap ap port allocator structural output vp env files specifies microcontroller devices connected reads definition devices device library controller library diagram shown dev proc files lib port allocation generates things device driver routines file schematic file sch file post processing tools convert schematic file formats dd dd pre allocation device driver synthesizer optional phase converts timing diagram file td format seq expect device library input chinook synthesis system consists user specification system verilog device library controller library


faculty staff chair dowdy lawrence director computer engineering biswas gautam director graduate studies fisher douglas director undergraduate studies fischer patrick professors adjoint associate professor rowan william jr vanderbilt 1955 carnegie mellon 1993 ph north carolina state 1965 ph politecnico di milano 1979 williams adjunct associate professors vanderbilt 1953 1957 brown wayne ph 1957 1962 1959 1960 professors ph vanderbilt 1988 dowdy lawrence gordon karen florida state 1974 mississippi state 1974 ph duke 1976 1977 1975 fischer charlotte ph maryland 1981 british columbia 1952 lecturer 1954 apon amy ph cambridge 1957 ed missouri 1979 fischer patrick 1981 1983 michigan 1957 1958 ph vanderbilt 1981 ph massachusetts institute adjunct assistant professor technology 1962 miller william associate professors california irvine 1973 biswas gautam west coast 1981 tech indian institute ph la 1995 technology 1977 staff ph michigan state 1980 richter william andrew jr andy 1983 systems administrator fisher douglas kathryn administrative ph california irvine assistant 1980 1983 1987 fitzpatrick michael north carolina 1967 north carolina 1982 ph florida state 1972 raghavan vijay tech indian institute technology delhi 1980 ph minnesota 1983 1988 schach stephen sc sc hons sc cape town 1966 1967 1969 sc weizmann institute science 1972 ph cape town 1973 jeremy yale 1978 ph princeton 1979 1980 1982 modified december 20 1996


cse 403 software engineering general info david notkin winter 1995 323 sieg mwf 10 30 11 20 instructor david notkin 414 sieg hall 685 3798 notkin cs washington teaching assistant chow cs washington office hours check online schedule definitive information office hours instructor ta required work participation designing building presenting team project midterm examination final examination readings brooks mythical man month mmm ghezzi jazayeri mandrioli fundamentals software engineering similar books notkin details lot handouts expect read carefully exams examinations tentatively scheduled monday february 6 class regularly scheduled final monday march 13 9 30 10 20am midterm examination cover material including design examination comprehensive grading contribution project account 75 total grade midterm account 10 grade final account 15 intangibles class participation affect grade project grade based quality work effort project graded individuals group generally receive grades final evaluation group projects 1 demonstration project 2 group discussion project process building 3 separate discussions individual group member time consuming process place tuesday march 14 wednesday march 15 plan lectures lectures cover topics software lifecycle characteristics large systems software specification software design techniques development tools testing verification validation maintenance lectures coordinated stages project invited lecturers giving impression software engineering problems software engineering companies chart shows tentative schedule lectures exams subject frequent change week monday wednesday friday 1 2 class overview overview lifecycle 1 9 lifecycle requirements requirements 1 16 class design design 1 23 design design design 1 30 testing testing testing 2 6 midterm formal methods formal methods 2 13 environments environments 2 20 class safety reliability 2 27 architecture process metrics 3 6 tba tba tba sections sections variety ways including group meetings ta presentations groups groups project requirements large scale software projects require teams designers implementors support staff construction projects demands technical abilities skills group dynamics give experience dynamics form groups people requirements design implement assigned project produce system schedule handed friday schedule includes milestones represented specific artifact preview draft requirements specification document milestone due wednesday 18 january group member involved meeting milestone instance person charge testing complex system understand low level implementation choices required state explicitly involved milestone capacity recommend strongly document written single person editing provide additional information timely basis expect artifact document describing requirements specifications handed wednesday full set high quality artifacts similar project nice surprisingly difficult acquire schedule artifact essential complete entire project quarter reason schedule meet group alternatives careful reasoned motivations don plan working milestone time part team ahead milestones coming project description intentionally defined group responsible making decisions user interface data structures goal milestones group make decisions orderly manner feel free questions expected ta answer questions customers special knowledge constraints quarter details include team select team minutes meetings motivation minutes forget decisions made costly terms time energy spend time formatting handwritten minutes fine copied distributed group members bring extra copy minutes tuesday section ll scan team progressing records individual personal log logs checked occasion sections intended track time log time sheets employers require complete includes date description activity time explanatory text sample select categories consistent minutes don format find keeping bound notebook effective bring tuesday sections ll turned end quarter entries personal log date category time hours notes 30 sep lecture 1 0 notkin intro 1 oct project planning jane join group 2 oct lecture 1 0 intro continued didn follow word 2 oct reading 3 0 mmm chaps 1 7 2 oct future read silver bullet 3 oct lecture 1 0 basic sw life cycle 3 oct reading 2 0 finished mmm note entries essentially instantaneous forming group note times attached things categories group meetings planning editing debugging development language ada cases good motivation grant permission group alternative language case permit group language group members programming expertise quarter add burden learning programming language group communicate addition selecting management structure recommend decide firm times group subgroup meetings distinguish status updates brainstorming meetings decision making meetings group lose member reasons expected close ranks adjust problem losing personnel happen real world motivation carefully documenting step project path software development predictable desirable plan beginning reasonable subsets system computer resources precious needed real world academia respect machines loaded unavailable critical times warned people projects make mistakes don save files crash delete key directories careful develop managerial technical approaches reducing kind error similarly approaches helping group track multiple versions artifacts including code time consuming make time don stare space program compiling don draw complex figures computer quick sketch hand sufficient don debug statements program project description check project description information quarter project check project schedule information project schedule notkin cs washington update 1 6 95


3333 interested indian classical music primarily interested mathematical theoretical aspects indian classical music interested aesthetic religious spiritual social aspects music dance drama exciting relevant knowledge indian music reading books listening performances master practitioners art occasionally post brand wisdom usenet newsgroup rec music indian classical links posted articles updated reformatted form found note rigorously scheme indian names terms material familiar comments criticisms suggestions contents articles send communication krishna cs wisc list essays theory mixed relationships deriving part deriving part ii asymmetric scales scales corpus effects music information equivalents jana 3 4 notes philosophy fidelity compositions owns greatest concert stupid music critic names interesting items search krishna kunchithapadam modified thu aug 1 02 27 30 cdt 1996 kk


selections hotlist politics white house national performance review home page government politics central intelligence agency home page department treasury internal revenue service constitution table articles commercial cd connection commercial services net mother jones ordering info internet shopping network peripheral pro global electronic marketing service internet mall reference reference line reference works index multimedia information sources jargon file 3 1 0 hypertext webster interface computing linux documentation project python programming language league programming freedom tcl tk resources tcsh man page miscellaneous xerox parc pubweb server world world wide web sports carnegie mellon university california banned books line netsurfer digest home page beer page


universities community colleges page ut austin web central links web servers universities community colleges server listed campus primary central server absence central server server selected visit world lecture hall faculty worldwide web deliver materials universities universities 06 january 97 check regularly additions web universities alphabetic list universities ordered alphabetically web universities state list universities ordered state university add update entry form add update university community colleges community colleges 06 january 97 check regularly additions web community colleges alphabetic list community colleges ordered alphabetically web community colleges state list community colleges ordered state community college add update entry form add update community college 06 january 97 statistics teamweb ut austin send comments


advanced materials internet www web developer virtual library advanced topics html cgi http webmaster encyclopedia http


1986 motor pool status report summary number drivers 2 number cars 4 completely operational oc 3 adequate emergency ec 0 dead wife dormant dc 1 primary goal maintain oc secondary goal force dc detailed status car 1 1975 plymouth valiant 4 door 318 v8 ps mi status operational pending repairs rear future work replace parts trunk bed fix noisy exhaust leak manifold cure slow leak tire parts status spare tire hand car 2 1949 plymouth special 4 door 6 mi status dead pending repairs start future work needed runs stops parts status car 3 1973 volvo 4 spd od mi status operational pending repairs drive seat front future work replace steering column coupling improve ease steering improve water car parts status steering column coupling hand seat order car 4 1973 volvo 4 spd od mi status operational dry days pending repairs switch relay front seat future work improve ease steering improve water car parts status order watch space updates photos travis craig modified oct 9 1995


family pictures alexander age 11 geoffrey age 9 timothy age 6 frances age


cs a10 introduction computer programming ll learn design build interactive software systems modern programming environment code debug multi file projects design language independent algorithms data structures design application program interfaces code libraries write simple code networked client server computing works exemplified world wide web texts eric roberts art science handouts web pages scheduling note schedule mccormick school engineering means classes meet reading week computing requirements assignments ready access platforms pc compatible 386 borland turbo preferrably version 4 5 macintosh preferrably symantec unix machine gnu windows athena motif widget set addition matter platforms computer northwestern network web browser preferrably netscape 1 1n recent release mosaic ftp program ftp unix fetch macintosh ftp client windows pc notes announcements assignments code network topics basic programming language concepts constants integers floats strings variables reading writing data expressions arithmetic logical control statements iteration branching switch functions calling defining prototyping files basic computer science concepts data structures strings arrays pointers algorithms algorithm analysis software development libraries defining interface implementation development environments files projects debuggers program design requirements analysis algorithm data structure design modules application program interfaces api coding maintainability testing debugging programming large application concepts graphics graphical interactive interfaces event driven programming assignments work load learn lot learn lot basic concepts taught lectures assessed exams real learning occur programming assignments time consuming comments send mail chris riesbeck


work related berkeley project ucla cs division mit media labs brian bershad univ washington seattle stanford cs home page kevin jeffay group unc univ arizona home page os research projects rsi related information computer related repetitive strain injury


frame file 2tb exps sergio transfer rcv1 knn rcv1 webkb parser1 webkb flat header html frame home frame file 2tb exps sergio transfer rcv1 knn rcv1 webkb parser1 webkb flat list html www computer architecture home page picture table contents top ten newest links architecture groups projects people computer architecture calls papers calls participation technical organizations commercial information relevant literature line publications miscellanea usenet architecture related newsgroups eckert mauchly award winners contributing page top 10 newest links call papers september 1997 special issue ieee computer billion transistor processors ieee transactions parallel distributed systems line intel pentium pro design manuals micro 28 line proceedings micro 27 line proceedings supercomputing 94 line proceedings penn state vlsi architecture cad group federal university rio brazil project purpose page serve index information relevant computer architecture researchers plan point information store locally include submissions inclusion interpreted endorsement contribution accuracy importance architecture groups projects university amsterdam architecture research group university arkansas computer architecture group barcelona computer architecture department upc berkeley brass berkeley reconfigurable architectures system software berkeley iram intelligent dram berkeley brigham young reconfigurable logic lab uc davis computer architecture research laboratory california irvine advanced computer architecture lab superscalar processors parallel machines carnegie mellon parallel data lab cornell net atm cluster data diffusion machine digital equipment corporation western research laboratory computer architecture section electrotechnical laboratory japan ics crete greece computer architecture vlsi systems georgia tech computer architecture parallel simulation gmd manna centre computer architecture university sweden harvard hube research group university houston high performance computing illinois aggressive coma illinois impact illinois paradigm illinois advanced languages architectures dept computing imperial college london iowa state advanced computer architecture research irisa caps team compiler parallel architecture systems team kyushu university japan project loughborough university united kingdom electronic systems design group lund university sweden project mcgill concordia earth mcmaster university advanced computer design laboratory michigan high performance microprocessor project minnesota agassiz minnesota dice minnesota high performance parallel computing research group mit computer architecture group mit alewife mit concurrent vlsi architecture mit start ng university newcastle virtual memory research group mexico state parallel architecture research lab nc state tinker notre dame laboratory advanced parallel systems nyu ultracomputer research project ohio state parallel architecture communication group hardware compilation group oxford university dept information technology university italy penn state vlsi architecture cad group princeton shrimp purdue adapter parallel execution rapid synchronization university rhode island high performance computing laboratory university rhode island high ilp computer project rice treadmarks federal university rio brazil project university rochester cashmere project pram scalable coherent interface simple coma usc advanced computer architecture laboratory spark scalable multiprocessor research group usc usc smart interconnects group rpm multiprocessor usc south florida vlsi computer architecture parallel processing group stanford architecture arithmetic group stanford flash stanford hydra suny stony brook experimental computer systems lab advanced computer architecture laboratory university southern california information sciences institute s3 mp scalable shared memory multiprocessor group sun suny buffalo high performance computing laboratory swedish computer architecture swiss zurich electronics laboratory texas san antonio high performance computing lab university toronto numachine multiprocessor university utah avalanche scalable multiprocessor design project technical university valencia spain parallel architectures group gap university virginia computer architecture washington computer architecture washington simultaneous multithreading project wisconsin galileo wisconsin multiscalar wisconsin wind tunnel wisconsin computer architecture calls participation 1997 3 3rd annual workshop computer architecture education 1996 asplos vii acm seventh international conference architectural support programming languages operating systems asplos cluster workshop information fcrc federated computing conference fcrc program federated computing conference program hot interconnects hpca 2 postscript high performance computer architecture workshop interaction compilers computer architectures conjunction hpca isca international symposium computer architecture mascots international workshop modeling analysis simulation computer telecommunication systems micro 29 international symposium microarchitecture paid 96 1996 workshop performance analysis impact design 96 1996 acm sigda physical design workshop supercomputing 96 1995 euro par 95 hpca international symposium high performance computer architecture icpp international conference parallel processing ipps international parallel processing symposium isca international symposium computer architecture micro international symposium microarchitecture pact 95 parallel architectures compilation techniques 95 pacific rim international symposium fault tolerant systems 12th ieee symposium computer arithmetic 4 4th international workshop sci based high performance low cost computing sigmetrics international conference measurement modeling computer systems 1994 asplos vi international conference architectural support programming languages operating systems micro international symposium microarchitecture supercomputing 94 calls papers 1997 hpca international symposium high performance computer architecture workshop interaction compilers computer architectures hpca 3 ics international conference supercomputing ieee computer september 1997 special issue processors future billion transistors ipps international parallel processing symposium isca international symposium computer architecture ppopp acm symposium principles practices parallel programming 3 3rd annual workshop computer architecture education 1996 euro par 96 frontiers 96 6th symposium frontiers massively parallel computation hot chips 8 hpca international symposium high performance computer architecture workshop computer architecture education conjunction hpca ieee computer special issue applications shared memory multiprocessors ieee international conference algorithms architectures parallel processing ics international conference supercomputing special issue atm switching international journal computer systems science engineering icse 96 session networks distributed systems isca international symposium computer architecture international symposium parallel architectures algorithms networks iopads 96 workshop parallel distributed systems micro international symposium microarchitecture pact 96 international conference parallel architectures compilation techniques paid 96 1996 workshop performance analysis impact design 7th international workshop persistent object systems spaa 96 eighth annual acm symposium parallel algorithms architectures spdp 96 symposium parallel distributed processing special issue special purpose architectures real time imaging journal real time imaging supercomputing 96 1995 international conference high performance computing icpp international conference parallel processing ipps international parallel processing symposium isca international symposium computer architecture postscript micro international symposium microarchitecture sigmetrics international conference measurement modeling computer systems part 95 conference parallel real time systems 4 4th international workshop sci based high performance low cost computing spaa symposium parallel algorithms architectures organizations advanced research projects agency arpa usa association computing machinery acm acm sigarch ieee computer society ieee technical committee computer architecture ieee technical committee operating systems application environments ieee technical committee supercomputer applications ieee technical committee application national science foundation nsf usa nsf advanced computational infrastructure program commercial information technical alpha axp architecture systems convex exemplar cray research products ibm 400 ibm personal computers ibm power parallel ibm rs 6000 ibm system 390 intel p6 mips products pa risc instruction manual sgi power challenge ultrasparc technical white papers technical amdahl ap circuits apple convex dec dolphin exponential hal hp ibm intel intel supercomputer systems division technologies microunity chromatic research motorola nec computer germany home page silicon graphics sun tandem computers tera virtual computer corporation computer architecture related books macintosh technology common hardware reference platform apple computer powerpc microprocessor common hardware reference platform apple computer international business machines motorola designer guide vhdl peter alpha implementations architecture mips programmer handbook erin farquhar philip computer architecture pipelined parallel processor design michael flynn cache memory book jim handy computer architecture quantitative approach edition john hennessy david patterson powerpc architecture specification family risc processors international business machines risc system 6000 powerpc system architecture international business machines computer arithmetic algorithms israel koren introduction parallel algorithms architectures arrays trees hypercubes thomson leighton scalable shared memory multiprocessing daniel wolf weber parallel processing applications systems dan computer organization design hardware software interface david patterson john hennessy cache memory hierarchy design performance directed approach steven dlx instruction set architecture handbook philip david architecture supercomputers titan case study daniel philip koopman computer organization architecture fourth edition william stallings power powerpc principles architecture implementation shlomo weiss james smith architecture related line publication resources bibliographies architecture bibtex bibliographies isca bibliographies bibliographies architecture bibtex bibliographies ieee transactions parallel distributed systems isca bibliographies conference proceedings 1996 asplos vii 1995 micro 28 supercomputing 95 1994 micro 27 supercomputing 94 miscellanea augmint tracing simulation tool benchmarks faq byu trace archive chip list ibm pcs compatibles cmu multicomputer system software computer pipelining overview historical background cpu info center uc berkeley faq roadmap embedded systems internet historical computers university maryland instruction set simulation tracing tools intel pentium pro design manuals www interconnection network homepage international trace archive nmsu tracebase minimal instruction set computing numerically ordered chip directory oral presentation advice including david patterson give bad talk sel hpc article archive simplescalar processor simulation tool suite spec spec benchmark information supercomputing web server vlsi information university idaho wisconsin architectural research tool set warts news comp arch comp dsp comp parallel comp compilers comp doc techreports comp sys intel contributing page send mail www arch cs wisc include category item text link link pointer architecture groups projects http www cs wisc university wisconsin madison computer architecture page created maintained doug burger mark hill university wisconsin madison computer sciences department modified dburger cs wisc mon jan 8 14 04 00 cdt 1996


introduction code code tutorial overview code visual parallel programming system thought framework allowing user compose sequential code parallel program fundamental idea users create parallel programs drawing annotating graphs graph diagram consists nodes represented icons code arcs interconnect nodes diagram shows computation communication structure nodes represent computations arcs represent flow data computation parallel programs created composing nodes graphs users draw nodes interconnect arcs standard creating program code user draws graph shows parallel program communication structure user annotates graph filling forms describe properties nodes arcs graph user sequential computation node performs finally user runs program code translates compiles executes simple user runs code empty window appears graph drawn window code graphs node types meanings node type represented icon important type node computation node represents sequential computation nodes composed form parallel programs drawing arcs define data flow figure shows complete code program computation nodes arcs code program program integrates function interval dividing interval half integrating piece separately results added form final answer program consists computation nodes arcs represent data created computation needed program runs executes fires computation node called split interval divides interval half sends endpoints intervals half nodes nodes integrate function interval receive split interval run parallel arcs node sum print waits results integrations prints sum annotating graph drawing graph part creating code program annotating graph defines parallel structure program annotations define aspects program computations performed conditions node fire data types defined program annotations added filling object annotation form figure shows annotation form computation node split interval note annotation forms displayed information tool upper left hand corner screen clicking code object code program notice start node option selected means node executed program begins start node allowed likewise stop node allowed fires program execution ends sequential computation defined node part specification specification includes mapping data incoming outgoing arcs local data computation conditions node allowed fire discuss details specifications section page specifications img introduction code emery cs utexas updated 15 august 1995


cs 766 supplementary reading sources image processing textbooks gonzalez woods digital image processing addison wesley reading mass 1992 russ image processing handbook crc press boca raton fl 1992 pratt digital image processing 2nd ed wiley york 1991 jain fundamentals digital image processing prentice hall englewood cliffs 1989 computer vision textbooks ballard brown computer vision prentice hall englewood cliffs 1982 haralick shapiro computer robot vision ii addison wesley reading mass 1992 guided tour computer vision addison wesley reading mass 1993 horn robot vision mcgraw hill york 1986 faugeras dimensional computer vision mit press cambridge mass 1993 computer vision monographs marr vision freeman san francisco 1982 integration visual modules extension marr paradigm academic press york 1989 solid shape mit press cambridge mass 1990 grimson object recognition computer role geometric constraints mit press cambridge mass 1990 foundations vision mass 1995 paper collections general eds readings computer vision morgan kaufmann los altos ca 1987 kasturi jain eds computer vision principles computer vision advances applications ieee computer society press los alamitos ca 1991 paper collections special topics brown terzopoulos eds real time computer vision cambridge university press cambridge 1994 mundy eds geometric invariance computer vision mit press cambridge mass 1992 ed active perception lawrence erlbaum hillsdale 1993 blake eds active vision mit press cambridge mass 1992 wolff shafer eds physics based vision principles practice volumes shape recovery color jones bartlett boston 1992 jain flynn eds dimensional object recognition systems elsevier amsterdam 1993 papers sensors blinn world digital video ieee computer graphics applications 12 5 1992 106 112 blinn ntsc nice technology super color ieee computer graphics applications 13 2 1993 17 23 active optical range image sensors machine vision applications 1 2 1988 127 152 sinha jain range image analysis handbook pattern recognition image processing computer vision young ed academic press york 1994 185 237 image processing human computer interface eyes interface image vision computing 13 6 1995 511 525 tomasi guibas image descriptions browsing retrieval proc image understanding workshop 1994 freeman roth orientation histograms hand gesture recognition proc int workshop automatic face gesture recognition 1995 freeman television control hand gestures proc int workshop automatic face gesture recognition 1995 kanade vision based human hand tracking cmu tr cmu cs 93 220 1993 al uncalibrated stereo vision pointing man machine interface machine vision applications 1994 file called ps gee intrusive gaze tracking human computer interaction proc machine vision practice 1994 112 117 file called gee ps gee determining gaze faces images university cambridge technical report tr 174 1994 file called gee ps gee fast visual tracking temporal consensus university cambridge technical report tr 207 1995 file called gee ps lam davis recognizing faces showing expressions proc int workshop gesture face recognition 1995 papers web mosaics image mosaicing tele reality applications dec crl technical report 94 2 1994 kang direct methods visual scene reconstruction proc workshop representation visual scenes 1995 kumar anandan irani bergen hanna representation scenes collections images proc workshop representation visual scenes 1995 hansen anandan dana van der burt real time scene stabilization mosaic construction proc image understanding workshop 1994 457 465 burt anandan image stabilization registration reference mosaic proc image understanding workshop 1994 425 434 irani improving resolution image registration computer vision graphics image processing graphical models image processing 53 1991 231 239 chen quicktime vr image based approach virtual environment navigation proc siggraph 95 1995 29 38 mcmillan bishop modeling image based rendering system proc siggraph 95 1995 39 46 mcmillan acquiring immersive virtual environments uncalibrated camera university north carolina technical report tr95 006 1995 mann picard video orbits projective group perspective image mosaicing mit media lab technical report tr 338 1995 morphing view synthesis wolberg digital image warping ieee computer society press los alamitos ca 1990 beier neely feature based image metamorphosis proc siggraph 92 1992 35 42 lee shin wolberg image metamorphosis snakes free form deformations proc siggraph 95 1995 439 448 chen williams view interpolation image synthesis proc siggraph 93 1993 279 288 seitz dyer physically valid view synthesis image interpolation proc workshop representation visual scenes 1995


cs 516 projects spring 1996 mulva report real deal 500 network computer jeffrey moore william lee serial storage architecture scott dawson leong kian fai kernel endpoint linux net ankit patel gerry toll porting pvm sp2 active messages chris george pang parallel object recognition subspace methods split jody shapiro matt parallel modeler alex benton parallel ray tracing cc sp 2 vineet ahuja amith yamasani parallel rendering mesa felix lung han wang david wu video conferencing atm hani jamjoom mohamed parallel rivl unet sugata mukhopadhyay jonathan barber parallel file system split libby lin gang gong parallel ray tracer mike perham keith kwok parallel image processing package justin miller kevin mai implementation ip net avinash gupta vivekananda kolla


snapshots recent trip europe bicycling utrecht holland back bike losing passengers earlier bike ride santa margherita ligure italy italy italy uw architects seattle weather prague


fall 1996 cmps131 grading policy procedures assignments 20 exercises assigned weekly recitation collected start recitation solutions exercises posted immediately recitation late submissions accepted prior approval quizzes 10 quizzes lecture irregularly notice project 20 1 major individual programming effort assigned semester students encouraged propose individual programming projects projects submitted demonstrated day classes examinations 30 3 examinations scheduled semester textbook materials exams final examination 20 final exam comprehensive score fifty percent 50 higher final exam required pass textbook materials final exam final grade grade scale 90 80 65 percent student scores eighty percent 80 including 3 exams elect receive final letter grade percentage score taking final examination academic honesty students respect principles academic honesty times assignment individual project quizzes exams product student individual efforts exceptions instructor accept late assignments good reason prior approval instructor waive assignments quizzes extreme circumstances instructor responsible specifications modification cmps131 tekin ces cwru updated 26 august 96


pittsburgh etiquette real conscious sets conduct correct reasonable newcomers pittsburgh accustomed set examples include waiting end traffic light cycle make left turn traffic making traffic run smoothly unnecessarily drivers parking front claim parking space street front house supermarket cart groceries car parking lot neighbors affairs turn signals correctly abroad southwestern pennsylvania follow correct rules conduct matter sizable pittsburgh population small town result native residents choose follow reasonable set home reasonable rules similar correct set modified taking account fundamental axiom close personal relationship presence axiom examples change slightly read car opposite direction intersection close personal friend won mind saving time running light turns green waiting end traffic cycle friend walking mind friend friend mind blocking driveway minutes town parking space shouldn long walk back house ll borrow shopping cart good friend manager local giant eagle bring back time friendly neighbors close personal friend neighbor pay special attention private affairs times trouble turn signals reasonable set conduct results viewed positive bus driver neighborhoods festivals summer checkout person friendly excerpted reid rich guide living pittsburgh 7th ed cmu cs july 1991 4 pierce cs cornell


pre requisites cs 537 prerequisites feel meet contact praveen cs discuss enroll knowledge basics relational database systems taught cs 432 broad topics passing familiarity relational data model relational algebra calculus sql file structures heap indexing structures tree briefly covered start ability program projects involve adding code database system written experience writing code feel pick background info home page programmed talk enrolling information term project idea sort programming required introductory courses data structures cs 410 equiv operating systems


caltech spring 1996 cs assorted topics including java homeworks java lectures programs links neos problem solving package project reports updated april 30 1996 cs138 cs caltech questions contact tas adam eve paul mika copyright 1994 96 mani chandy rights reserved reproduction part work permitted educational research provided copyright notice included copy disclaimer collection notes experimental serve substitute attendance actual class


cse 415 programming project 3 due 17 5pm turnin directed details covered class thursday precise description message included heuristic selection transformation proving trigonometric identities due friday 17 project involves symbolic problem solving creation representation facilitates implementation learning learning part simply involves problems solved program improve problem solving power problem start simple trigonometric identities tan sin cos cot cos sin 1 sin sec 1 cos 1 operators transform left side equation side produced problem solved point thing find represent problem operators including operators added problems solved programming simple features left sides operators problem identities chosen deciding operator apply apply cover class identities operators solve problems prove tan cot 1 write lisp functions deal cases implement problem solver start basic identities prove identities add identities set solving future problems require programming short time set initial identities standard form write lisp program select transformation identity problem identity make possibly selections based heuristics standard form replace sin symbol cos tan cot sec remove signs moving terms side identity remove signs multiplying denominator remove exponents repeated multiplication remove integer coefficients repeated addition 1 aa bb 1 final step lexically order side identity switch sides left side lexically side tan sin cos bc identities restricted functions single variable standard form sum products form product terms lexically ordered form greatly reduces variability representation equivalent identities good general rule ai transform problem standard form variety equivalent forms reduced program assume inputs identities standard form list identities transforms identities problem identities write functions heuristic methods defined function select transform identity applied solving problem proving left side problem identity transformed side functions pick transform identities heuristic methods named simplification familiarization effectiveness heuristic simplification heuristic scoring function difference number symbols left sides transform identity identity selected sides applicable left side problem identity problem prove standard form aa bb cc ff transform identity aa bb 1 applied left side problem simplification score 4 5 symbols left side including sign symbol side applying left side reduce number symbols 4 greatest score selected program print scores identities problem identification numbers identities familiarization heuristic transform identities 16 identities list table packet 1 id numbers listed list numbers familiarity score transform identities id list show familiar identity familiar transform identity chosen closest head list applied left side problem identity effectiveness heuristic complex supposed provide score called measure applicability left sides identity left side identity degree identity make left side identity side identity approximate measure degree make left side current problem closer side goal define feature set left side set single objects pl left side set pairs objects product terms pl set pairs product terms pl common objects divided make feature set left side side left side side feature sets feature weight complexity sum symbols feature give added importance matching features lots symbols aa bb cc ff aa bb cc aa bb aa cc bb cc 1 1 1 2 2 2 5 5 5 feature set left side weight feature ff 1 2 similar feature sets identities score computed adding weights features present weight multiplied factor intended show single feature hinder finding solution compute feature examined compared feature set left sides feature fi weight wi factor di sum wi di features find di possibilities feature left side side left side side situation 1 0 1 0 desirable situation applying left side left side remove feature left side feature side solve problem situations scores 1 0 1 0 4 0 1 0 1 4 1 0 0 1 4 0 1 1 0 4 1 0 0 0 1 0 1 0 0 1 1 1 0 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 4 factors arbitrary aa bb cc ff aa bb cc aa bb aa cc bb cc 1 1 1 2 2 2 5 5 5 ff 1 2 assume scored aa bb 1 aa bb aa bb 1 1 1 2 2 5 1 features scored time giving situation 1 0 1 0 1 4 feature adds 4 features aa bb aa bb 1 0 1 0 considered 4 4 8 8 20 44 feature 1 considered 0 1 0 0 1 contributes 1 effectiveness score applying 43 notes familiarity heuristic list 4 1 2 10 6 5 3 14 11 8 9 15 12 13 7 integers list correspond 15 identities list packet 1 problem identities program find identity heuristics separately identities 20 28 38 program print scores computed id selected problem found


cse143 announce thread recent messages messages sorted date subject author mail archives starting sun 29 sep 1996 00 00 pst ending sun 01 dec 1996 00 00 pst messages 61 bradford chamberlain hw1 update bradford chamberlain web grading turn policies added bradford chamberlain reminder quiz due tomorrow bradford chamberlain quiz 1 solution set posted bradford chamberlain sick owen benneter flatley reminder homework due tomorrow bradford chamberlain thursday quiz bradford chamberlain acrobat versions lecture section notes added bradford chamberlain hw1 solution set posted bradford chamberlain hw2 web bradford chamberlain future readings craig chambers quiz 2 web bradford chamberlain adt hw2 impl strategies craig chambers important announcement craig kaplan quiz thursday bradford chamberlain hw2 floating point precision craig chambers hw2 craig chambers hw3 craig chambers hw2 solutions craig chambers pointer exercise added web bradford chamberlain quiz bradford chamberlain revised implementation craig chambers reminder open notes quiz tomorrow bradford chamberlain midterm date craig chambers quizzes solutions posted web page bradford chamberlain review session monday evening bradford chamberlain quiz 3 quiz 4 status bradford chamberlain updated reading assignments craig chambers recursion examples craig chambers correction pointer chasing exercise solution bradford chamberlain midterm solutions craig chambers quiet bradford chamberlain quiet quiet midterm solutions text craig chambers homework 4 craig chambers homework 4 hong ngo homework 4 hong ngo hw3 sample solutions craig chambers big analysis exercises quiet kevin forbes reading assignments craig chambers hw4 specific implementation kevin forbes quiz thursday craig chambers thursday quiz bradford chamberlain sample executables world fwd dunn web quiz update bradford chamberlain fun java sorting demo bradford chamberlain sorting bradford chamberlain brad java crazy bradford chamberlain skeletons accessible craig chambers ftp back craig chambers thanksgiving consulting samuel adams hw4 solutions reading assignment craig chambers message date sun 01 dec 1996 00 00 pst archived sun dec 01 1996 16 49 22 pst messages sorted date subject author mail archives archive generated hypermail 1 02


george forman dissertation research fractal bar overview current focus work constructing tools aid writing applications provide good interactive responsiveness environments resource availability hard predict highly dynamic applications depend networking indirectly networked file system encounter orders magnitude bandwidth variability mobile computing environment interface switch wireless wired connections operating systems effectively hide great network variation applications flexible resource demands remain usable periods degraded service graphic modem ethernet bandwidth end dissertation research develops application framework runtime system express manage logical units resource demand concurrency progressive quality results gaining responsiveness user interface principally trading short term quality response introductory material read abstract dissertation technical details online fractal bar pages longer maintained demos running windows implemented prototype system test ideas consists set language extensions pre processor convert multi threaded code runtime system manage dynamic task graph written interactive applications prototype system library catalog database browser mandelbrot fractal generator web browser photo albums incremental resolution demonstration system resources plentiful easy good response time resources scarce responsiveness support begins demos designed exceed capacity local resources 1 program run fractal explorer generates multiple mandelbrot fractals incrementally concurrently mouse position controlling priority windows screen dump fractal explorer photo album browser downloads collection photographs progressively improving quality prioritization pictures screen dump photo album browser 2 permit application connect display execute unix command xhost trouble cs washington 3 enter display washington 0 ip address 12 34 56 78 0 execute read starts users demo fatal bug compiled dec alphas note 1 applications meant run user delay server application large ll experience delayed responsive performance meaning control priority slowly 2 students run large simulations departmental hosts bringing knees ll things notice fractal bar fractal explorer demo 1 reading directions operating program notice zoom fractal refining ability proceed incomplete result important variability system response time increases today feature implemented tasks expected long time system service time increases variability feature implemented tasks 2 zooming fractal windows rapid succession simultaneously refining images move mouse notice application concentrates resources selected fractal fractal cpu attention primary blocked thread synchronization 3 point mouse windows observe fractals improve resolution roughly rate roughly half fast 4 color enhancement feature zoom part fractal low contrast fractal variation color quickly type color runs entire image histogram equalization function slow notice function run successive images produced fractal generator 5 illustrate inside application rapid succession zoom area set toggle button open window zooming type window display colored version window diagram task graph diagram illustrates task graph generated sequence user events green tasks added typed output fractal image generator consumed display task window coloring task output display task window series refined images passes data flow graph 6 portion task graph disconnected output display internal program variable runtime system graph garbage collects storage zoom fractal refining witness user interface resource savings improve performance tasks care fractal bar photo album browser demo suppose show friend lunch photograph baby pull mobile computer access home photo album wireless network downloading baby pictures long time photo album browser downloads displays images incrementally bandwidth consumption photos search picture imagine scenario browser find sunset photograph quickly mind internet higher bandwidth wireless network effect prioritization pronounced desired priorities network connections communicated wireless base station implemented experimental setup demo web 1 observe effect priority press return url window restart downloads quickly open pictures move mouse observe selected picture refined faster obvious refinements resolution finer refinement number pixels image 2 application pre fetches picture edge strip observe restart downloads wait resolution improvements note picture rightmost strip scroll pictures notice difference resolution picture george forman gforman hpl hp home page mail finger map weather cs dept uw live picture generated wed oct 2 11 18 37 pdt 1996


utcs alumni links 1970 herb schwetman ph 1971 jo ann howell ph 1979 paul reynolds ph 1980 jon webb ph 1981 shou stephen huang ph 1982 lane foster 1986 manuel hermenegildo ph tracy parker chris walker 1987 raghu ramakrishnan ph 1988 lance hahn carol ph 1989 lewis barnett ph william ph david tor rustan leino wayne mock michelle ph 1990 david crow bill foster jeff haynes dan dan prabhu subramanian ph shar 1991 karl branting ph ken calvert ph campbell iii ph 1992 anish arora ph dan dvorak ph david goldschlag ph john hartman ph steve travis mark ph chuck walbourn charlie wood 1993 sanjoy baruah ph christoph 1994 alexander chan steven tei wei kuo ph jorge ruiz brian smith lynn jerrell watts 1995 foster fisher kar patrick su 1996 utcs graduate link home page included send email including year graduation url gripe cs utexas


survey topics cs537 papers required survey recent research papers topic present survey current thinking topic form survey paper submit postscript document preferably latex format proper paper words introduction sections bibliography present material requires good understanding subject material simply matter paper blah paper blah tie reading survey reader informed insight topic tough find helps lot road topics listed topics stem project list choose topic talk give initial paper started track references library collect papers expect survey 5 papers fine person works survey topic people topic discuss person write individual survey paper query optimization 1 join enumeration techniques 2 selectivity cost estimation techniques 3 view maintenance data warehousing data mining 1 deriving association rules 2 classification 3 clustering indexing techniques 1 multi dimensional tree structures transaction processing 1 advanced transaction models 2 workflow 3 recovery algorithms buffer management 1 replacement algorithms storage management 1 replicated storage partitioned storage 2 tertiary storage real time databases database security databases www olap line analytical processing parallel query processing 1 query processing algorithms 2 system design issues object oriented database systems 1 swizzling techniques 2 garbage collection database benchmarking heterogeneous databases 1 semantic consistency schema integration 2 query processing


classes class extension struct introduce classes slowly extending functionality structs studied week apparent differences class struct addition data members struct class member functions methods member functions operations objects belong class imagine wanted augment alien struct declared week alien capable giving greeting declare class const int 20 class alien public char char int int void char notice added additional member called class alien unlike members member declared variable array member prototype function takes array characters produces return added word public talk prototype half function give function definition void alien char cout friends lot normal function definition return type void parameter list char code making function body function alien class declaration prototype class method member function called robot class method order method providing body give class function called alien read meaning method alien class thing called scope resolution operator operand case scope operand case alien grab part class additional operator hold variables method declared method body means defined method alien class call suppose couple aliens appears main alien alien talked initializing objects time assume home planet lord home planet death star call functions code appears main dad mom call method object variable dot operator file streams remember cin getline fin getline accessing data members structs basically dot operator grab piece object contrast scope resolution operator line call method object argument dad line call method object argument mom lines messages objects dad mom reason call variables objects abstract sense entities receive messages interact make calls variables correspond whichever object makes call asked dad asked mom death star calls generate screen output dad friends mom lord death star friends exercise extend class declaration include method called mutate takes integer returns write method definition mutate adds integer argument aliens number legs accept negative arguments time alien drop solution constructors point notes written lecture terse make sense leaving doesn make sense remove class alien public char char int int alien char nm char home int legs int deadly void char void mutate int alien alien char nm char home int legs int deadly strcpy nm strcpy home legs deadly overloaded class alien public char char int int alien alien char nm char home int legs int deadly void char void mutate int alien alien set reasonable defaults 0 0 0 0 0 0 alien alien char nm char home int legs int deadly strcpy nm strcpy home legs deadly point don call strcpy constructors talk decide call parameters types args typical overloaded function show main function alien init values calls lame constructor alien tokyo 7 2 1 points ponder doesn happen args constructor called default constructor good idea make array classes assign class call constructor explicitly make type assign alien home 2 0 alien resolve clash constructor alien alien char char int int strcpy alien strcpy alien alien alien constant member class alien public const int killer 1 const int lamb 0 killer lamb constants alien methods calls alien 2 alien killer hide magic number point constants friday class public private talk separation implementation interface ways thing preferably shown define impl idea provide common interface hides details implementation replace code avoid things 2 semantic error means give show constructors void alien read char cout enter alien cin ws cin getline 20 cout enter home world cin getline 20 cout enter number legs cin cout deadly cin toupper contrast void alien char cout enter alien cin ws cin getline 20 cout enter home world cin getline 20 cout enter number legs cin cout deadly cin toupper accessor functions tips make member variables private define accessor functions assignment operator alien catalog hangman covered object modified fri nov 8 11 29 42 1996 todd turnidge turnidge cs wisc


william chan department computer science engineering university washington box 352350 seattle wa 98195 2350 usa office chateau 112 fax 206 543 2969 phone 206 616 1853 email wchan cs washington year grad student hong kong working doctoral degree computer science department university washington work shoot officemates shoot research interests working validating large software system requirements specifications symbolic model checking joint work group smart people richard anderson paul beame steve burns francesmary modugno david notkin jon reese recently analyzed early version tcas ii traffic alert collision avoidance system system requirements specification written requirements state machine language rsml bdd based model checker symbolic model verifier paper appeared acm sigsoft 96 fse 4 continued interests systems theory undergrad cornell worked ken birman robbert van renesse horus project distributed system based group communications publications richard anderson paul beame steve burns william chan francesmary modugno david notkin jon reese model checking large software specifications postscript gzipped postscript proceedings fourth acm symposium foundation software engineering sigsoft 1996 pages 156 166 october 1996 awards microsoft fellowship 1996 1997 sir edward memorial scholarship overseas studies hong kong 1991 1994 teaching teaching assistant cse 143 computer programming ii cse 451 operating systems cse ee 461 introduction computer communication networks cse 473 artificial intelligence cse 521 design analysis algorithms grad education left high school queen college hong kong 1991 received bachelor science distinction computer science department cornell university ny 1994 related links university washington software engineering software safety university minnesota mats heimdahl university waterloo joanne cmu formal methods model checking stanford university hardware verification group university california berkeley design technology warehouse tom henzinger sri formal methods dependable systems formal methods bell labs sigsoft fse 97 floc 96 dac 96 cav 97 computing research association unified computer science tr index computer science technical report archive sites networked computer science technical reports library glimpse search university arizona university washington libraries line dictionary computing advice research writing elements style free speech william chan wchan cs washington


helping cornell robotics vision lab super supervision ramin zabih read page ramin part cornell university originally montreal quebec canada family move minneapolis minnesota stationed kansas city kansas