linguistic string project lsp courant institute mathematical sciences 251 mercer street york ny 10012 tel 212 998 3097 fax 212 995 4123 email sager cs nyu publications 1 sager 1967 syntactic analysis natural language advances computers 8 153 188 academic press ny 2 sager 1966 information reduction texts syntactic analysis seminar computational linguistics 1966 pratt roberts lewis eds pp 46 56 division computer science technology national institutes health bethesda md publication 3 sager 1967 elimination grammatical restrictions string grammar english conference internationale sur le automatique des grenoble august 1967 4 sager 1970 sublanguage method string grammars studies language linguistics 1970 1971 jr eds pp 89 98 university texas el paso 5 sager 1972 stage bnf specification natural language journal cybernetics 2 3 39 50 6 sager 1972 syntactic formatting science information afips conference proceedings 41 791 800 afips press nj reprinted sublanguage studies language restricted semantic domains eds walter de gruyter berlin 1982 pp 9 26 7 sager 1973 string parser scientific literature natural language processing ed pp 61 87 algorithmics press ny 8 grishman 1973 implementation string parser english natural language processing ed pp 89 109 algorithmics press ny 9 grishman sager friedman 1973 linguistic string parser afips conference proceedings 42 427 434 afips press nj 10 fitzpatrick sager 1974 lexical subclasses linguistic string parser american journal computational linguistics 2 item 9 reports 11 sager 1975 sublanguage grammars science information processing journal american society information science 26 10 16 12 sager grishman 1975 restriction language computer grammars natural language communications acm 18 390 400 13 hirschman grishman sager 1975 grammatically based automatic word class formation information processing management ll 39 57 14 anderson sager 1975 grammatical compression notes records analysis computation american journal computational linguistics 2 4 15 sager 1975 computerized discovery semantic word classes scientific fields directions artificial intelligence natural language processing courant computer science report 7 27 48 courant institute mathematical sciences york university 16 hobbs grishman 1976 automatic transformational analysis english sentences implementation international journal computer mathematics section vol 5 pp 267 283 17 friedman 1976 computational treatment coordinate american journal computational linguistics 52 18 hirschman grishman sager 1976 text structured information automatic processing medical reports afips conference proceedings 45 267 275 afips press nj 19 sager 1977 perspective paper computational linguistics natural language information science perspectives directives research walker karlgren kay eds 551 75 100 stockholm 20 hirschman grishman 1977 fact retrieval natural language medical records ifip world conference series medical informatics 2 wolf eds 247 251 north holland amsterdam 21 sager 1977 information structures language science faces information science aaas selected symposium 3 weiss ed 53 73 westview press boulder colorado 22 sager hirschman grishman 1977 transforming medical records structured data base waltz natural language interfaces acm sigart newsletter 61 feb 1977 38 39 23 sager parsing free narrative unpublished paper presented annual meeting association computational linguistics georgetown university washington dc march 17 1977 24 sager hirschman grishman 1977 computer programs natural language files information management 1980 proceedings asis annual meeting 14 knowledge industry publications white plains ny 25 sager 1978 natural language analysis processing encyclopedia computer science technology belzer kent eds vol 11 pp 152 169 marcel dekker ny 1983 edition paperback reprinted subject information analysis ed marcel dekker ny 1985 26 sager lyman 1978 computerized language processing implications health care evaluation medical record news 49 3 june 1978 20 30 27 grishman hirschman 1978 question answering natural language medical data bases artificial intelligence 11 1978 25 43 28 sager 1978 natural language information formatting automatic conversion texts structured data base advances computers 17 ed 89 162 academic press ny 29 sager hirschman lyman 1978 computerized language processing multiple narrative discharge summaries proceedings annual symposium computer applications medical care ed 330 343 ieee york 30 hirschman sager lyman 1979 automatic application health care criteria narrative patient records proceedings annual symposium computer applications medical care dunn ed 105 113 ieee york 31 sager 1980 review computational linguistics medicine schneider eds north holland ny 1977 american journal computational linguistics 6 1 jan mar 1980 44 7 32 hirschman 1981 retrieving time information natural language texts information retrieval research robertson van rijsbergen williams eds london 154 171 33 hirschman sager 1982 automatic information formatting medical sublanguage sublanguage studies language restricted semantic domains eds walter de gruyter berlin 1982 pp 27 80 34 sager 1981 natural language information processing computer grammar english applications addison wesley reading mass 35 sager tick story hirschman 1980 type schema natural language medical records proceedings fourth annual symposium computer applications medical care 2 neill ed 1027 1033 ieee york 36 hirschman story marsh lyman sager 1981 experiment automated health care evaluation narrative medical records computers biomedical research 14 5 oct 1981 447 463 37 sager story marsh 1982 automatic encoding clinical narrative computers biology medicine 12 1 1982 43 56 38 story hirschman 1981 database design natural language medical data proceedings 14th annual hawaii international conference system sciences iii reprinted journal medical systems 6 1 1982 77 88 39 hirschman story 1981 representing implicit explicit time relations narrative proceedings 7th international joint conference artificial intelligence ijcai 81 1 289 295 40 sager 1981 information structures texts sublanguage asis 81 conference proceedings 41 sager grishman 1982 research computational linguistics york university acm sigart newsletter special issue natural language processing 42 marsh sager 1982 analysis processing compact texts coling 82 proceedings ninth international conference computational linguistics ed 201 206 north holland amsterdam 43 grishman hirschman friedman 1982 natural language interfaces limited semantic information coling 82 proceedings ninth international conference computational linguistics ed 89 94 north holland amsterdam 44 sager chi tick lyman 1982 relational database design computer analyzed medical narrative proceedings sixth annual symposium computer applications medical care blum ed 797 804 ieee york 45 marsh 1983 utilizing domain specific information processing compact text proceedings conference applied natural language processing 99 103 association computational linguistics menlo park ca 46 grishman hirschman friedman 1983 isolating domain dependencies natural language interfaces proceedings conference applied natural language processing 46 53 association computational linguistics menlo park ca 47 chi sager tick lyman 1983 relational database modeling free text medical narrative medical informatics 8 3 1983 209 223 special issue methods analysis clinical data taylor francis london 48 lyman chi sager tick story 1983 automated case review acute childhood proceedings 83 amsterdam august 1983 49 sager 1983 database literature organized relations proceedings 7th annual symposium computer applications medical care ed 692 695 ieee computer society silver spring md 50 friedman sager chi marsh lyman md 1983 computer structuring free text patient data proceedings 7th annual symposium computer applications medical care ed 688 691 ieee computer society silver spring md 51 sager wong md 1983 developing database free text clinical data journal clinical computing xi 5 6 1983 184 194 52 sager tick story friedman 1983 data model natural language information acm sigart newsletter 86 oct 83 special issue database research 51 53 white 1983 linguistic string project dictionary automatic text analysis proceedings workshop machine readable dictionaries sri international menlo park ca published 54 gordon sager 1985 method measuring information language applied medical texts information processing management 21 4 aug 85 269 289 55 wolff 1984 regularities medical vocabulary automatic lexical coding methods information medicine 23 1984 195 203 56 sager 1984 sublanguage linguistic phenomenon computational tool analyzing language restricted domains grishman eds pp 1 17 lawrence erlbaum 1986 57 friedman 1984 sublanguage text processing application medical narrative analyzing language restricted domains grishman eds pp 85 102 lawrence erlbaum 1986 58 chi friedman sager lyman 1985 processing free text input obtain database medical information proceedings 8th annual acm sigir conference research development information retrieval june 1985 york association computing machinery 59 marsh friedman 1985 transporting linguistic string project system medical navy domain acm transactions office information systems 3 2 april 1985 121 140 60 sager chi friedman lyman md 1985 modeling natural language data automatic creation database free text input database engineering 8 3 sept 1985 45 55 61 sager 1985 natural language processing biomedical laboratory computing frontiers engineering computing health care 1985 lin eds vol 1 575 8 proceedings 7th annual conference ieee engineering medicine biology society sept 1985 mcgregor werner washington dc 62 chi lyman sager friedman macleod 1985 database computer structured narrative methods computing complex relations proceedings 9th annual symposium computer applications medical care ackerman ed ieee computer society press washington dc pp 221 226 63 lyman sager friedman chi 1985 computer structured narrative ambulatory care review clinical data proceedings 9th annual symposium computer applications medical care ackerman ed ieee computer society press washington dc pp 82 86 64 london wolff sager 1985 lsp lexicon free text information formatting application medical narrative workshop lexicon parsing semantic interpretation graduate center city university york jan 1985 65 sager friedman lyman md members linguistic string project 1987 medical language processing computer management narrative data addison wesley reading ma 66 sager 1986 representing biomedical information linguistic structure proceedings congress 86 vol 4 pp 278 281 levy md williams md eds american association medical systems informatics washington dc 1986 67 sager friedman lyman md chi macleod chen johnson 1986 analysis processing clinical narrative 86 proceedings conference medical informatics blum jorgensen eds elsevier science publishers north holland participants ed part 2 pp 1101 1105 68 sager jr friedman chi 1989 information structures survey instruments proceedings section survey research methods american statistical association 69 lyman sager 1989 york university experience computer processing medical language computerized natural medical language processing elsevier science publishers north holland 70 sager 1989 medical language processing computer management narrative data computerized natural medical language processing elsevier science publishers north holland 71 sager lyman tick nh agraven su 1989 adapting medical language processor english french proceedings sixth conference medical informatics elsevier science publishers north holland 72 sager lyman nh agraven tick su 1989 cost containment quality care assessment product fully integrated handling free text analysis discharge summaries poster presentation 73 sager book review eds computational analysis english corpus based approach longman london york 1987 information processing management 25 3 pp 334 335 74 lyman sager chi tick nh agraven su 1989 medical language processing knowledge representation retrievals proceedings 13th annual symposium computer applications medical care ed ieee computer society press washington pp 548 553 75 lyman 1989 applications medical language processing york university linguistic string project presentation paper abstract proceedings asis annual meeting eds published american society information science learned information medford nj 252 76 sager nh agraven su lyman tick chi 1989 analyse automatique de informatique sant eacute informatique des unit de du aim paris 1989 stephan paris springer verlag pp 246 256 77 nh agraven sager lyman tick su 1989 medical language processor indo european languages proceedings 13th annual symposium computer application medical care ed ieee computer society press washington pp 554 558 78 sager 1990 computer analysis sublanguage information structures annals ny academy sciences york york academy sciences vol 683 pp 161 179 79 lyman sager nh agraven tick 1991 application natural language processing healthcare quality assessment medical making 11 4 pp 80 lyman nh agraven tick sager 1991 tool automatic determination patient clinical profiles text analysis proceedings 15th annual symposium computer applications medical care mcgraw hill 81 sager lyman tick nh agraven clinical knowledge bases natural language patient documents proceedings seventh conference medical informatics elsevier science publishers north holland 82 sager lyman nh agraven tick 1994 natural language processing representation clinical data med informatics soc vol 1 2 pp 142 160 83 sager lyman nh agraven tick 1994 automatic encoding iii preliminary investigation proc symp computer applications medical care symp 1994 230 234 84 sager lyman nh tick 1995 medical language processing applications patient data representation automatic encoding methods information medicine 34 140 146 85 sager nh lyman tick 1995 computer analysis clinical narrative paper presented symposium language voice technology healthcare working group institut voor en belgium feb 22 1995 86 sager nh agraven lyman tick 1996 medical language processing sgml display proceedings 1996 annual fall symposium washington dc oct 26 30 1996 hanley pp 547 551


cse 326 data structures bboard mail log autumn 1996 page log mail class mailing list cse326 cs list announcements general interest class students feel free questions post information initiate discussions general interest class questions comments general interest directed ta dewey cs instructor tompa cs administrative requests mailing list add delete address change requests addressed cse326 request cs send initial subscribe request cse326 request registered automatically initial mailing list index messages latest message tuesday 10 dec 96 08 47 53 pst 26 sep 96 tompa cs testing mail log 3 oct 96 tompa cs cse326 mailing list 3 oct 96 tompa cs learning unix 4 oct 96 dewey cs unix tips 4 oct 96 tompa cs reading assignments 4 oct 96 dewey cs big 7 oct 96 tompa cs chapter 6 7 oct 96 translation table 8 oct 96 cs joke damn clock 8 oct 96 tompa cs hw1 4 5 8 oct 96 tompa cs omega 9 oct 96 tompa cs hw1 3 10 oct 96 tompa cs hw2 11 oct 96 tompa cs absence week 11 oct 96 tompa cs hw2 top 11 oct 96 chapman makefile 11 oct 96 tompa cs reading chapters 6 7 11 oct 96 tompa cs hw2 stack queue items 11 oct 96 dewey cs makefile 12 oct 96 dewey cs homework 2 guidelines 12 oct 96 dewey cs homework 2 question 12 oct 96 makefile 14 oct 96 dewey cs negative numbers 14 oct 96 hw2 stack hw2 stack queue items fwd 14 oct 96 dewey cs iostream 14 oct 96 dewey cs homework 2 questions 14 oct 96 input input stream 14 oct 96 dewey cs homework 2 questions 15 oct 96 dewey cs divide 0 15 oct 96 dewey cs submission guidelines 15 oct 96 submission submission 15 oct 96 dewey cs general announcements 15 oct 96 dewey cs input stream 15 oct 96 dewey cs cerr redirecting files 15 oct 96 dewey cs due date testing program 15 oct 96 dewey cs due date testing program 16 oct 96 dewey cs due date testing program 16 oct 96 dewey cs due date testing program 21 oct 96 tompa cs chapter 7 reading 22 oct 96 tompa cs scaling homework totals 23 oct 96 dewey cs office hours 24 oct 96 tompa cs hw3 25 oct 96 cs hw3 25 oct 96 tompa cs hw3 27 oct 96 tompa cs hw3 28 oct 96 tompa cs clarification trees 28 oct 96 tompa cs splay trees 30 oct 96 tompa cs chapter 8 midterm 31 oct 96 tompa cs 2 related issues 31 oct 96 tompa cs midterm questions 1 nov 96 tompa cs mail weekend 1 nov 96 tompa cs hw4 3 1 nov 96 tompa cs hw4 midterm 2 nov 96 tompa cs money tree analysis 4 nov 96 tompa cs midterm solutions 10 nov 96 dewey cs homework averages 11 nov 96 tompa cs hw5 display 11 nov 96 tompa cs section 8 5 reading 12 nov 96 tompa cs hw5 display 12 nov 96 tompa cs print tree 12 nov 96 dewey cs homework turnin driver 12 nov 96 dewey cs submission guidelines 13 nov 96 dewey cs homework due time 13 nov 96 dewey cs concat 14 nov 96 tompa cs hw5 driver recap yesterday 14 nov 96 tompa cs preparing lecture 14 nov 96 tompa cs part 2 hw5 14 nov 96 cs 14 nov 96 14 nov 96 bone cs 15 nov 96 cs spaces acceptable 15 nov 96 dewey cs acceptable input 15 nov 96 tompa cs spaces 15 nov 96 cs problems turnin 15 nov 96 cs problems turnin 16 nov 96 dewey cs replies homework 18 nov 96 tompa cs reading section 9 1 21 nov 96 tompa cs readings heap applications 21 nov 96 tompa cs background reading graphs 21 nov 96 dewey cs office hours appointment 21 nov 96 tompa cs hw6 4 2 dec 96 tompa cs graph reading 2 dec 96 tompa cs final exam 2 dec 96 tompa cs character frequencies hw7 3 dec 96 tompa cs clarifications hw7 3 dec 96 tompa cs hw7 format frequency file 4 dec 96 dewey cs hw7 driver 4 dec 96 dewey cs important homework 7 submission 5 dec 96 tompa cs hw7 interesting efficiency idea 5 dec 96 tompa cs office hour monday 12 9 6 dec 96 dewey cs eof 6 dec 96 dewey cs hw7 6 dec 96 dewey cs thought makefile 6 dec 96 dewey cs separate file 6 dec 96 cs hw7 6 dec 96 dewey cs clarification 8 dec 96 dewey cs make submit test 8 dec 96 dewey cs multiply defined 8 dec 96 dewey cs sample input 8 dec 96 dewey cs huffman tree 9 dec 96 cs sample input 9 dec 96 sample input 9 dec 96 tompa cs encoding length 9 dec 96 sample sample input 9 dec 96 eugene cs sample input 9 dec 96 tompa cs 2 9 dec 96 dewey cs optimal comparison 9 dec 96 tompa cs 5057 bits 9 dec 96 cs script bomb 9 dec 96 cs input 256 char 9 dec 96 problem files 9 dec 96 shafer cs problem files 9 dec 96 problem files 9 dec 96 cs problem files 9 dec 96 cs problem files 9 dec 96 cs input 256 char 9 dec 96 cs optimal comparison 9 dec 96 cs input 256 char 9 dec 96 cs optimal comparison 10 dec 96 eugene cs optimal comparison 10 dec 96 cs compiling messages cse326 geoduck subject testing mail log martin tompa tompa geoduck cs washington cse326 cs subject cse326 mailing list martin tompa tompa geoduck cs washington established mailing list cse326 cs class announcements discussion mail list automatically logged web http www cs washington education courses 326 read place feel free mailing list questions post information initiate discussions general interest class questions comments general interest directed ta dewey cs instructor tompa cs administrative requests mailing list add delete address change requests addressed cse326 request cs send initial subscribe request cse326 request receiving mail initial mailing list martin cse326 geoduck subject learning unix martin tompa tompa geoduck cs washington questionnaire don unix half compiler ll spend time comfortable unix link 326 home page called lab tech notes called notes unix users pretty good summary basics directory cse courses cse326 f96 sample project project includes readme makefile source files couple input files copy directory steps grizzly cd brings back home directory grizzly mkdir project creates directory project grizzly cp cse courses cse326 f96 sample project project copies files cse courses cse326 examples sample project directory files readme makefile compiling running project cse326 cs subject unix tips brian dewey dewey cs washington tips unix systems classmates guarantees work find xemacs simply computer configured providing forwarded message check mail cse326 cs attached aliases file alias xemacs uns bin xemacs prints single sided sieg 329 printer alias print lpr prints double sided sieg 329 printer alias enscript 2r rr rr cs washington http www cs washington homes nice day end forwarded message cse326 geoduck subject reading assignments martin tompa tompa geoduck cs washington today lecture asked read sections 3 1 3 3 monday lecture read sections 4 1 4 4 pretty fast largely review promise ll slow material cse326 cs subject big brian dewey dewey cs washington quiz section thursday asked difference big notation definitions book hadn material needed back book explaination answering turns definitions book similar identical big notation measure growth rates functions constants 0 0 cg grows roughly definition constants 0 exists constant 0 cg constants 0 key difference definitions doesn measure growth rates function case dominated function don difference functions grow similarly function dominates isn immediately clear prove remember definition requires check constants including constant 0 5 brian cse326 geoduck subject chapter 6 martin tompa tompa geoduck cs washington wednesday lecture read pages 175 183 jason washington cse326 geoduck cs washington subject translation table hey based appendix notation conversion table read expression book translate code helps understand notation p1 p2 double pointer type node c1 c2 common regular variables fact node types exhaustive conversions interpretation table appendix notation equivalent c1 c2 c1 c2 p1 p2 p1 p2 p1 p2 p1 p2 c1 c2 c1 c2 note result expression generally hope helps writing thing write translate wishes jason jason university washington seattle wa 98195 washington cs washington cse326 cs washington subject joke damn clock wife complains wall clock killed mother today fell seconds couch husband mumbles damn clock slow rr rr cs washington http www cs washington homes nice day cse326 geoduck subject hw1 4 5 martin tompa tompa geoduck cs washington questions similar ways showing theta 1 provide constants cf df sufficiently large 2 rule sums rule products instance loop bound running time loop body 1 bound number iterations 1 apply rule products forwarded message tompa cs washington subject assignment 1 cse 326 problems 4 5 assignment 1 find big theta code fragments ta justification involve finding decent running time function code solving big big omega usual mathematical gave examples class expecting solutions end forwarded message cse326 geoduck subject omega martin tompa tompa geoduck cs washington forwarded message martin tompa tompa cs washington subject question clear omega notation om give explanation apply sum rule om class 23 nlogn 1 om n^2 om om nlogn explain answer 1st 3rd cases end forwarded message 1st 23 nlogn 1 2 n^2 1 2 n^2 1 choose 1 2 0 1 apply definition omega 3rd 23 nlogn 1 2 n^2 1 2 nlogn 1 choose constants gave explanation class salient explanation apply function growing slower n^2 sum rule omega true apply prove good exercise proof proof sum rule cse326 geoduck subject hw1 3 martin tompa tompa geoduck cs washington forwarded message martin tompa tompa geoduck cs washington dewey cs washington ed subject problem 3 filling table don answer log 2 solve estimate answer time period end forwarded message don analytical solve case calculator simple program find greatest cse326 geoduck subject hw2 martin tompa tompa geoduck cs washington forwarded message martin tompa tompa cs washington subject hw2 algorithm 3 3 shows linked list implementation stack interest data type required implementation stack confused book contiguous memory implementation queue imply fixed maximum size queue queue dynamic end forwarded message algorithm 3 3 simulate call reference simply making parameters call reference suffice thinking required handle memory leaks stack implementation contiguous memory implementation stacks queues requires maximum number entries needed chief disadvantage linked implementation chief advantage doesn pointers hw2 make maximum queue size 200 remind makefile make life easier required turn cse326 geoduck subject learning unix martin tompa tompa geoduck cs washington questionnaire don unix half compiler ll spend time comfortable unix link 326 home page called lab tech notes called notes unix users pretty good summary basics directory cse courses cse326 f96 sample project project includes readme makefile source files couple input files copy directory steps grizzly cd brings back home directory grizzly mkdir project creates directory project grizzly cp cse courses cse326 f96 sample project project copies files cse courses cse326 examples sample project directory files readme makefile compiling running project cse326 geoduck subject absence week martin tompa tompa geoduck cs washington conference monday wednesday october 14 16 ll leave brian capable hands days 1 continue lectures dictionaries monday wednesday ll pick friday left 2 office hour monday canceled questions discuss leave free time today 3 october 12 october 16 send urgent mail questions hw2 dewey cs cc won reading mail cse326 geoduck subject hw2 top martin tompa tompa geoduck cs washington forwarded message tompa cs washington subject top intended top user top stack class private variable called top pop book function top pop function user make stack queue create empty stack queue declare expected make destructors classes extra layer function calls end forwarded message client won top hw2 users general order inspect top stack removing intended destructors constructors operations create return brand empty stack queue randy chapman chapman cse326 cs washington subject makefile noticed makefile sample project doesn properly recompile headers change useless task thoughts added program objects headers line program objects sources headers note needed objects line lower makes explicit destination randy cse326 geoduck subject reading chapters 6 7 algorithm 6 9 martin tompa tompa geoduck cs washington monday lecture read section 6 4 wednesday lecture read section 7 1 algorithm 6 9 beware ve 3 versions textbook 3 algorithm 6 9 fine interchangeable purposes line lc rc lambda lc lc simply cross line makes sense uninitialized cse326 geoduck subject hw2 stack queue items martin tompa tompa geoduck cs washington clarify expect stack queue items hw2 possibly simplest solution item record consisting fields int char boolean boolean int char variations union type class cse326 cs washington subject makefile reply message fri 11 oct 1996 14 01 06 pdt brian dewey dewey cs washington thought add note clarification randy message people familiar makefile works program make makefile determine parts project depend parts randy modification objects headers tells make program objects files depend headers files make program notices files newer files attempt rebuild files happen randy pointed cse326 cs subject homework 2 guidelines brian dewey dewey cs washington guidelines homework 2 1 driver program including simple driver program functions infix postfix postfix evaluate print result single expression file assumes ve named queue class queue infix postfix data standard input important write scripts test programs file include iostream class queue queue infix postfix int postfix evaluate queue main int result queue infix postfix cin result postfix evaluate cout result result endl permitted modifications file rename queue type match called data type program specs infix postfix returns queue postfix evaluate takes queue parameter pointers queues prototypes functions reference parameters queue modify driver program compile link method print contents queue included program specs technically speaking print operation defined queue decide include function debugging purposes feel free modify driver print contents queue assigning partial credit generate correct results inputs generating proper intermediate results 2 submission guidelines turn programming assignment turn hard copy class turn electronically files hard copy turn hard copy source files hard copy readme file details electronic copy turn 1 short file called readme file program complete isn complete program works bugs motivation homeworks run programs program doesn work ll spend time figure works don quickly wrong don readme file telling isn working ll guess estimate ll estimate 2 source files cc 3 makefile compile program typing make command line makefile change executable hw2 exe hw2 words change program line program hw2 exe 4 don turn executable don turn files lot room disk compile stuff turn electronic copy suppose files directory called hw2 ready turn type ls command line grizzly ls hw2 t2 suppose section ab type turnin cse326 ab hw2 hw2 grizzly turnin cse326 ab hw2 hw2 compressing submitted files wait files submitted cse326 hw2 grading grizzly details 1 put source files 2 comments comment function telling piece code completely obvious works put comment explaining 3 waiting class registered electronic turnin server attempt turn program receive broadcast message initialized monday cse326 cs subject homework 2 question brian dewey dewey cs washington input stream 1 digit numbers 567 78 987 90 receive full credit program handle numbers digit receive partial credit handle single digit numbers alan wilson washington cse326 cs washington subject makefile spiffy makefile update dependencies automatically make depend add lines end makefile move mf definition top makefile set appropriately cut makefile mf makefile cse 143 makefile dan fasulo 1 11 1994 revised juan alemany depend echo updating dependencies echo sources mf sed 1 ^ sudden death echo echo dependencies generated date echo sources compiler mm cflags echo mf mv mf mf mv mf mf line subject sudden death cut fri 11 oct 1996 brian dewey wrote thought add note clarification randy message people familiar makefile works program make makefile determine parts project depend parts randy modification objects headers tells make program objects files depend headers files make program notices files newer files attempt rebuild files happen randy pointed cse326 cs subject negative numbers reply message sat 12 oct 1996 15 26 41 pdt pine osf 3 95 100000 washington brian dewey dewey cs washington homework 2 questions handle negative numbers homework 2 assignment program parse negative numbers won give form 4 3 handle negative numbers show calculations 10 20 return result 10 valid expression spaces tokens make things easier write routines ll make test input spaces token noticed driver program delete end postfix evaluate isn technically end program good practice oops mistake bad form driver program delete end add delete end program cse326 cs subject hw2 stack queue items fwd reply message mon 14 oct 1996 08 58 15 pdt pine a32 3 95 100000 washington mime version 1 0 content type text plain ascii brian dewey dewey cs washington don deal fractional parts answers 2 5 evaluate pushing results stack popping operands enter 5 2 implicitly cast result operation int pushing stack don handle fractional results treat integer divide operator div cse326 cs subject iostream reply message sun 13 oct 1996 12 27 12 pdt pine ult 3 95 100000 wolf cs washington brian dewey dewey cs washington wrote small main program test stuff include iostream compile compiler complained find path iostream default par change gcc find path library iostream default include path isn path gcc error make compile program cse326 cs cc cse326 cs washington subject homework 2 questions reply message mon 14 oct 1996 00 29 58 pdt pine ult 3 91 100000 lynx cs washington brian dewey dewey cs washington destructor queue class understanding destructor dynamic allocation data isn didn make depends queue array stores pointers structures structures dynamically allocated program queue destructor structures pointed valid entries queue queue empty destructor called don delete thing elements left delete records errors handled assignment bit vague handled errors fairly brute working manner error message stack empty user entered bad input sufficient report stack empty user enter 1 2 input invalid infix postfix algorithm works stack empty guideline program dumps core didn handle error gracefully familiar unix core dump occurs program executes invalid instruction execute data invalid memory reference caused null pointers long print message indicating error occured truth don care message invalid operator attempted pop empty stack aliens invading mars quick run long error program terminates cse326 cs cc dewey cs washington subject input stream reply message mon 14 oct 1996 16 30 11 pdt pine ult 3 95 100000 grizzly cs washington mime version 1 0 content type text plain ascii brian dewey dewey cs washington test program entering input stream explain testing program write script redirect files program redirect output file script hw2 exe input dat output dat repeated input files ll compare output expected cse326 cs cc dewey cs washington subject homework 2 questions reply message mon 14 oct 1996 16 56 47 pdt pine ult 3 95 100000 lynx cs washington brian dewey dewey cs washington driver queue main create instance queue main dynamically create instance queue infix postfix originally intended infix postfix create queue return pointer doesn case people asked create queue main pass queue infix postfix reference parameter fine ways things method cse326 cs subject divide 0 reply message mon 14 oct 1996 19 22 57 pdt pine ult 3 91 100000 lynx cs washington brian dewey dewey cs washington worry divide excellent question technically avoid program dumps core standard error handling detect divide won test inputs divide result cse326 cs subject submission guidelines brian dewey dewey cs washington ve decided simple mail easier turnin program mail makefile readme file source code electronic submission couple ways easily send multiple files instructional workstations shar command command work shar makefile readme cc mail dewey cs lengthy command effective tar cf makefile readme cc uuencode userid tar mail dewey cs substitute userid userid enter command line fails cat makefile readme cc mail dewey cs cut paste files favorite interactive mail browser prefer options means manually reconstruct files single mail message change submission guidelines late assignment mail questions problems cse326 cs subject submission reply message tue 15 oct 1996 09 50 42 pdt pine ult 3 95 100000 grizzly cs washington mime version 1 0 content type text plain ascii brian dewey dewey cs washington submitted files mail wondering find bug program correct resubmit turnin resubmit cse326 cs subject general announcements brian dewey dewey cs washington 1 ll cubicles 4th floor sieg afternoon 2 30 3 30 ll questions time 2 homework 1 graded returned quiz section thursday cse326 cs subject input stream reply message tue 15 oct 1996 16 44 53 pdt pine osf 3 95 100000 washington brian dewey dewey cs washington brian kind late thought pass info redirect input file people testing programs command line word warning people standard taking things input stream cin input warned infinite loop enter input command line unix environment caused student amount runs problem simulate end file command line typing control cse326 cs subject cerr redirecting files reply message tue 15 oct 1996 16 55 54 pdt pine osf 3 95 100000 washington brian dewey dewey cs washington student pointed cerr error reporting redirected file output avoid cerr cout cerr print error messages don worry fact slightly programming practice cse326 cs subject due date testing program brian dewey dewey cs washington program class tomorrow ll accept electronic submissions midnight give hardcopy quiz section testing program cases 1 user enters single number 5 result 5 2 make operators work correctly 2 3 result 5 2 3 result 6 15 3 result 12 90 3 result 30 3 handle parenthesis properly 3 4 5 result 23 3 4 5 result 35 4 errors 3 attempting examine top empty stack cse326 cs subject due date testing program reply message tue 15 oct 1996 17 46 50 pdt pine osf 3 95 100000 washington brian dewey dewey cs washington 4 errors 3 attempting examine top empty stack hide level error user checking stack empty top pop case evaluation function cerr bad input stack handle errors correctly evaluation function attempts top pop empty stack true queue evaluation handle error long handled good cse326 cs subject due date testing program reply message tue 15 oct 1996 20 52 27 pdt pine osf 3 95 100000 washington brian dewey dewey cs washington program supposed handle input 5 10 2 3 1 program enters infinite loop errors bad hmm suggest terminating program encounter error situation prevents loop problem wouldn worry assignment important thing ve detected error input user smart hit ^c terminate program sees error messages filling screen cse326 cs subject due date testing program reply message wed 16 oct 1996 12 36 07 pdt brian dewey dewey cs washington free allocated memory exit error don worry freeing memory error terminate program error condition cse326 geoduck subject chapter 7 reading martin tompa tompa geoduck cs washington wednesday lecture read handout begin reading section 7 3 finish reading 7 3 friday lecture cse326 geoduck subject scaling homework totals martin tompa tompa geoduck cs washington purely administrative adjustment make hw1 absolutely effect final grade future homeworks starting hw2 total vicinity 75 100 order make hw1 comparable scale factor 2 total number points hw1 75 150 grade hw1 half paper effect grade homework worth amount total homework account 40 final grade announced lecture cse326 cs subject office hours brian dewey dewey cs washington nuts don mind afternoon forgot office hour lame attempt compensate ll bend backwards appointment days answer questions cse326 geoduck subject hw3 martin tompa tompa geoduck cs washington 1 students stuck part problem 1 formula geometric series page 18 text understand memorize top half formula case 1 time 5 show intermediate trees show final tree wrong ll lose lots points good idea show 10 trees insertion rotation cao cs washington martin tompa tompa geoduck cs washington cc cse326 geoduck subject hw3 problem 2 homework fact proving number leave full binary tree 2^n cao cs washington cc cse326 geoduck subject hw3 reply message fri 25 oct 1996 10 23 45 0700 pine ult 3 95 100000 lynx cs washington martin tompa tompa geoduck cs washington cao cs washington cc cse326 geoduck subject hw3 reply message fri 25 oct 1996 10 23 45 0700 pine ult 3 95 100000 lynx cs washington martin tompa tompa geoduck cs washington suffered network problems friday body message doesn header fact true lesson proving things true thing definition full forwarded message cao cs washington martin tompa tompa geoduck cs washington cc cse326 geoduck subject hw3 problem 2 homework fact proving number leave full binary tree 2^n end forwarded message cse326 geoduck subject clarification trees martin tompa tompa geoduck cs washington student office hour today asked question pointed neglected important trees confused tree node keys 1 children keys sorted node 1 children correspond places descendent key possibly occur keys keys keys 1 st kth keys greater keys organization lookup algorithm pretty obvious understand cse326 geoduck subject splay trees martin tompa tompa geoduck cs washington tricky question wednesday lecture defining splay case ii straight path rotate parent order rotate parent move levels accomplish hint case splay tree single path keys 1 2 order 1 root key cse326 geoduck subject chapter 8 midterm martin tompa tompa geoduck cs washington reading assignment read sections 8 1 8 3 possibly friday midterm monday cover including friday lecture closed book closed notes closed calculator room exam answers don blue book pencils good understanding ve cse326 geoduck subject 2 related issues martin tompa tompa geoduck cs washington 1 make office hours happy make appointment meet time don feel office hours times answer questions love material interested helping learn trouble 2 answer call martin manage choice captain captain cse326 geoduck subject midterm questions martin tompa tompa geoduck cs washington forwarded message tompa cs subject midterm web pages couldn find midterm exam previous wondering give sample midterm questions idea kind questions expect midterm end forwarded message ve make homework exercise important topics comfortable answering sorts questions asked homework ll good shape midterm won time consuming long proof designing complicated algorithm cse326 geoduck subject mail weekend martin tompa tompa geoduck cs washington forwarded message martin tompa tompa cs washington subject 2 related issues captain captain answer questions related material ll reviewing midterm email weekend end forwarded message ll remember log weekend answer mail won make promises questions arise weekend increase chance timely answer sending cc brian promising behalf ll read mail weekend 2 chances 1 brave send question cse326 smart colleagues multiplying chances 35 reasons mailing list cse326 geoduck subject hw4 3 martin tompa tompa geoduck cs washington handout long section decreased end algorithm handles left rotations rebalancing write algorithm inclination 2 3 copies long code left rotations mirror image rotations good programming style debugging correction copies copies nicer write subroutine symbolically call 3 times subroutine parameters 1 means subtree decreased height 1 means left subtree decreased height cse326 geoduck subject hw4 midterm martin tompa tompa geoduck cs washington announced class today 1 hw4 due wednesday responsible material monday midterm extra days hw4 writeup 2 won difficult splay tree analysis responsible understanding dictionary operations terms won questions require understanding proofs analysis lemmas cse326 geoduck subject money tree analysis martin tompa tompa geoduck cs washington forwarded message tompa cs subject money tree analysis understood tree analysis class today wasn obvious constant 3 term 3 gave explanation wasn grasp explain presence 3 question trivial end forwarded message question trivial trivial subtle money invariant needed 1 pay rotation 1 nodes assume case supply additional 1 2 case iii case showed read cases book case requires 1 case ii requires 3 3 case ii cse326 geoduck subject midterm solutions martin tompa tompa geoduck cs washington couple students pointed made mistake solution 4a 45 child 40 hard imagine problem wrong 4 0 class cse326 cs subject homework averages brian dewey dewey cs washington average grades homeworks homework 1 68 75 91 homework 2 90 100 homework 3 72 80 91 average homeworks 230 255 90 cse326 geoduck subject hw5 display martin tompa tompa geoduck cs washington forwarded message martin tompa tompa cs washington cc brian dewey dewey cs washington subject hw 5 display trees outline form figure 4 8 node left child child suggestions end forwarded message make output unambiguous leaving blank line missing child sufficient outline form cse326 geoduck subject section 8 5 reading martin tompa tompa geoduck cs washington wednesday read pages 284 285 289 291 cse326 geoduck subject hw5 display martin tompa tompa geoduck cs washington forwarded message tompa cs subject display display procedure prints tree 40 30 50 20 60 10 outline form 40 30 20 10 50 60 explicit end forwarded message turn question showed display 40 30 20 10 50 60 binary tree ignore fact binary search tree answer 20 left child 10 60 true answer knowing binary search tree 20 left child 30 20 30 imagine binary tree display calculations case nice display worked binary trees minimum display 40 30 20 10 50 60 explicitly putting indented dashes make clearer blank lines children empty cse326 geoduck subject print tree martin tompa tompa geoduck cs washington forwarded message dewey cs washington tompa cs washington subject print tree print trees part splay dictionary operation end forwarded message fine print dictionary operation brian working driver hw5 displaying fit driver ll post shortly meantime operations working properly cse326 cs subject homework turnin driver brian dewey dewey cs washington submission guidelines homework 1 submit code mail forgotten submission instructions copy email homework 2 couple ways easily send multiple files instructional workstations shar command command work shar makefile readme cc mail dewey cs lengthy command effective tar cf makefile readme cc uuencode userid tar mail dewey cs substitute userid userid enter command line fails cat makefile readme cc mail dewey cs cut paste files favorite interactive mail browser prefer options means manually reconstruct files single mail message emphasize options resort problems tar submission problems tar command lynx grizzly wolf 2 code main program modifications instructed include iostream typedef int boolean const int false 0 const int true 1 void show menu void cout choices endl cout insert endl cout delete endl cout lookup endl cout print endl cout quit endl cout enter choice endl int main void boolean true char choice cout cse 326 autumn 1996 homework 5 endl cout martin tompa endl cout student number endl cout initializing dictionary endl add code initialize dictionary delete line cout code initializing dictionary endl cout dictionary ready endl show menu cin choice cin consumes typed choice switch choice case cout insert endl add code insert delete line cout code insert endl break case cout delete endl add code delete delete line cout code delete endl break case cout lookup endl add code lookup delete line cout code lookup endl break case cout print endl add code print tree delete line cout code printing tree endl break case cout goodbye endl false break default cout don recognize choice endl good luck happy coding cse326 cs subject submission guidelines brian dewey dewey cs washington submission guidelines homework 1 submit code mail forgotten submission instructions copy email homework 2 couple ways easily send multiple files instructional workstations shar command command work shar makefile readme cc mail dewey cs lengthy command effective tar cf makefile readme cc uuencode userid tar mail dewey cs substitute userid userid enter command line fails cat makefile readme cc mail dewey cs cut paste files favorite interactive mail browser prefer options means manually reconstruct files single mail message emphasize options resort problems tar submission problems tar command lynx grizzly wolf 2 code main program modifications instructed include iostream typedef int boolean const int false 0 const int true 1 void show menu void cout choices endl cout insert endl cout delete endl cout lookup endl cout print endl cout quit endl cout enter choice endl int main void boolean true char choice cout cse 326 autumn 1996 homework 5 endl cout martin tompa endl cout student number endl cout initializing dictionary endl add code initialize dictionary delete line cout code initializing dictionary endl cout dictionary ready endl show menu cin choice cin consumes typed choice switch choice case cout insert endl add code insert delete line cout code insert endl break case cout delete endl add code delete delete line cout code delete endl break case cout lookup endl add code lookup delete line cout code lookup endl break case cout print endl add code print tree delete line cout code printing tree endl break case cout goodbye endl false break default cout don recognize choice endl good luck happy coding guidelines homework 1 submit code mail forgotten submission instructions copy email homework 2 couple ways easily send multiple files instructional workstations shar command command work shar makefile readme cc mail dewey cs lengthy command effective tar cf makefile readme cc uuencode userid tar mail dewey cs substitute userid userid enter command line fails cat makefile readme cc mail dewey cs cut paste files favorite interactive mail browser prefer options means manually reconstruct files single mail message emphasize options resort problems tar submission problems tar command lynx grizzly wolf 2 code main program modifications instructed include iostream typedef int boolean const int false 0 const int true 1 void show menu void cout choices endl cout insert endl cout delete endl cout lookup endl cout print endl cout quit endl cout enter choice endl int main void boolean true char choice cout cse 326 autumn 1996 homework 5 endl cout martin tompa endl cout student number endl cout initializing dictionary endl add code initialize dictionary delete line cout code initializing dictionary endl cout dictionary ready endl show menu cin choice cin consumes typed choice switch choice case cout insert endl add code insert delete line cout code insert endl break case cout delete endl add code delete delete line cout code delete endl break case cout lookup endl add code lookup delete line cout code lookup endl break case cout print endl add code print tree delete line cout code printing tree endl break case cout goodbye endl false break default cout don recognize choice endl good luck happy coding cse326 cs subject homework due time brian dewey dewey cs washington brought attention mentioned friday program due don ahead make midnight friday cse326 cs subject concat reply message wed 13 nov 1996 20 38 10 pst brian dewey dewey cs washington provide separate concat function place simpler matter putting directly delete code fine argue separate function principle cse326 geoduck subject hw5 driver recap yesterday lecture martin tompa tompa geoduck cs washington recap yesterday lecture hw5 driver place driver instance add code lookup delete line add roughly prompt read input key call function lookup call function display read display belong inside dictionary operations cse326 geoduck subject preparing lecture martin tompa tompa geoduck cs washington addition reading asked section 8 5 order understand proof universal classes hash functions comfortable notions discrete math 1 modular arithmetic understand mod binary operator called comfortable part binary relation mod 3 lines 2 don key means mod mod equivalently divisible 2 injection 1 1 function iff implies function iff 1 1 function cse326 geoduck subject part 2 hw5 martin tompa tompa geoduck cs washington students asked part 2 hw5 report 1 sequence operations resulted splay tree long path splay tree 2 operations deepest nodes trees resulted operations hall cs washington cse326 cs subject trouble program access null pointers check rc lc null functions avoid things null pointers problem checking pointer null segmentation fault looked pointer null program crashes checked pointer check pointers null crashing program root lc lc root null hope understandable hope alan wilson washington hall cs washington cc cse326 cs washington subject checking pointer dereferencing bad pointer null thing wrong bad root pointer null root valid alan root lc lc root null thu 14 nov 1996 hall wrote trouble program access null pointers check rc lc null functions avoid things null pointers problem checking pointer null segmentation fault looked pointer null program crashes checked pointer check pointers null crashing program root lc lc root null hope understandable hope alan don mind long interesting path ronald nicholas bone bone cs washington hall cs washington cc cse326 cs subject thu 14 nov 1996 hall wrote root lc lc root null explicitly checking lc null root lc null lc root null hope helps nic cs washington brian dewey dewey cs washington cc cse326 cs washington subject spaces acceptable input error checking required code works space int space accepts int int accepts char int accept int char accept int space int accept rr rr cs washington http www cs washington homes nice day cse326 cs subject acceptable input reply message fri 15 nov 1996 09 42 11 pst pine ult 3 95 100000 grizzly cs washington brian dewey dewey cs washington asked previous mail 10 spaces acceptable input 10 integer 10 spaces glance difference 10 10 computer string 1 0 number string lacks trailing spaces person doesn doesn care difference strings acceptable input isn confuse people program leading trailing whitespace input human cse326 geoduck subject spaces acceptable input martin tompa tompa geoduck cs washington long accept means program signals error gracefully doesn crash hang ve sorts things forwarded message cs washington brian dewey dewey cs washington cc cse326 cs washington subject spaces acceptable input error checking required code works space int space accepts int int accepts char int accept int char accept int space int accept rr rr cs washington http www cs washington homes nice day end forwarded message cs washington cse326 cs washington subject problems turnin problems turn share 15 min ago reply option doesn work option 9 min rr rr cs washington http www cs washington homes nice day cs washington cse326 cs washington subject problems turnin option work moving line fri 15 nov 1996 wrote problems turn share 15 min ago reply option doesn work option 9 min rr rr cs washington http www cs washington homes nice day rr rr cs washington http www cs washington homes nice day cse326 cs subject replies homework brian dewey dewey cs washington guess expecting high tech submission commands gave ways regular mail bells whistles automatic reply check email submissions mail back ve worried didn response submission received tonight fear hadn computer early evening yesterday friday night confusion brian cse326 geoduck subject reading section 9 1 martin tompa tompa geoduck cs washington read pages 298 304 lecture cse326 geoduck subject readings heap applications martin tompa tompa geoduck cs washington skip book order interesting applications heaps read section 11 3 pages 447 450 cse326 geoduck subject background reading graphs martin tompa tompa geoduck cs washington meant read section 12 1 dive pages 447 450 section 12 3 forwarded message martin tompa tompa geoduck cs washington cse326 geoduck subject readings heap applications skip book order interesting applications heaps read section 11 3 pages 447 450 end forwarded message cse326 cs subject office hours appointment brian dewey dewey cs washington people asked appointment tomorrow make general posting ll free 11 30 12 30 tomorrow 4th floor sieg questions feel free find cse326 geoduck subject hw6 4 martin tompa tompa geoduck cs washington amount confusion problem 4 underlying theorem universal classes hash functions lecture tomorrow armed questions ll happy time beginning class answer won give answers homework process cse326 geoduck subject graph reading martin tompa tompa geoduck cs washington read section 9 2 remainder section 12 3 cse326 geoduck subject final exam martin tompa tompa geoduck cs washington 2 30 4 20 monday dec 16 1996 usual classroom find exam schedule cse department home page cse326 geoduck subject character frequencies hw7 martin tompa tompa geoduck cs washington table letter frequencies english hw7 found http www cryptography caesar html invented frequencies encode full sentences 28 characters encode homework 200 010 009 030 130 028 016 035 074 002 003 035 025 074 027 003 093 027 013 016 005 019 001 cse326 geoduck subject clarifications hw7 martin tompa tompa geoduck cs washington brian wrote solution hw7 process uncovered issues left ambiguous problem statement clarifications brian 1 displaying huffman tree isn required turn debugging purposes import hw5 tree display function check huffman tree building correct ties child make left make resolve 2 streams problem statement talks character streams decoded string bit streams encoded string inputs outputs character streams easy standard streams reading characters keyboard displaying characters screen bit streams slightly complicated point encoding compress characters make sense function outputs chars 0 1 8 bits bit encoding brian working package handle bit streams broadcast ready meantime debugging purposes stream 0 1 chars standard cse326 geoduck subject hw7 format frequency file martin tompa tompa geoduck cs washington clarification courtesy brian didn format file character frequency pairs electronic turn turn frequency file format decide program read characters frequencies file practice frequencies changed set characters changed assignment assume 500 characters file set 28 characters earlier cse326 cs washington subject hw7 driver brian dewey dewey cs washington long awaited homework 7 driver long commented usable mail questions driver cse326 homework 7 written 3 december 1996 brian dewey ll make usual driver code work included file class called class store output bits huffman encoding bits back huffman decoding include stdlib include iostream todo insert headers class class abstraction unbounded queue bits defined operations bit puts bit stream bit stream isempty returns 1 stream empty 0 returns number bits stream call queue fifo bits bits extracted typedef int bit pass int functions efficient representation class public constructor destructor void bit put bit stream bit bit stream int return number bits int isempty empty stream private static int bs initial size initial size stream buffer bytes static int bits char number bits character void resize resize buffer char pointer bit stream buffer int current size buffer int length track current bits int bs initial size 1 int bits char 8 main driver code begins int main ll insert local variable store huffman tree encoding char answer encoding change cout brian dewey endl cout cse326 homework 7 endl insert cout string encode cin answer answer answer cout string lowercase letters spaces cout periods terminate string return cin input stream insert note encode type input marking end input store encoded string encoding cout compressed length encoding endl cout sanity check restored string insert invocation decode print cout cout endl cout string encode cin answer repeat delete encoding return 0 methods constructor sets stream bs initial size initial size char allocate memory length 0 initialize variables destructor deallocate stream buffer delete method puts bit stream algorithm loosely based queue implemented programming assignment tweaks 1 bytes queue buffer bits char bits buffer 2 store bits buffer aborting error increase size buffer care resize method space dies void bit unsigned int char mask 0 1 bit 0 1 abort error message cerr invalid bit endl abort length bits char resize ve run room resize buffer holds bit number find buffer length bits char byte bit resides bits char bit specifies bit byte concerned number range 0 bits char 1 bits char bit interested turn bit 1 turn bit 0 mask variable don worry follow lines 1 set bit mask 1 mask bit mask 1 mask ^ 255 mask length finally record bit stream resize bit hack work bit buffer wouldn method allocate buffer size current allocation fails abort program memory bits nasty part void resize char int cerr endl endl char 2 null cerr resize unable allocate memory endl abort contents don worry don follow code bits char 0 2 bits char delete returns current bit analagous dequeue simpler algorithms don worry stream empty abort program error message bit bit int mask length 0 abort error empty cerr bit string empty endl abort don worry follow bit operations follow bits char bits char mask 1 mask bits char length return isempty int isempty length 0 return 1 return 0 returns bits stored stream int return length cse326 cs washington subject important homework 7 submission procedures brian dewey dewey cs washington turn source files header files needed compile program program makefile data file storing character frequencies read procedure readme file telling program works turn electronically 11 59pm wednesday december 11th turn hardcopy care printing hardcopy electronic submission turn end message makefile makefile things change top file names customized beginning makefile type make depend makefile understands commands make submit make submit test makefile set make submit test ensure working send test message reasonable amount time hours minutes test message back acknowledgement received response hours send email find problem tested submission procedure wolf computer work program type make submit package files mail copy message minutes hours good luck happy coding cse326 homework 7 makefile modified earlier makefiles 4 december 1996 brian dewey include make submit make submit test options put userid user dewey put executable program hw7 exe put names header files don include system headers headers put names source files cc sources driver cc put names object files source file sources form cc filename form objects driver put character frequency input file frequency dat stuff change put compiler intend cc put extension intend files cc default cc makefile mf makefile dec running ultrix osf 1 line suffixes readme file readme readme line defines submitted make submit submit mf readme headers sources commands submitting files tar bin tar usr bin uuencode stuff shouldn change cflags wall libs program objects cc program cflags objects libs clean rm ~ cc cflags depend echo updating dependencies echo sources mf sed 1 ^ sudden death echo echo dependencies generated date echo sources cc mm cflags defines echo mf mv mf mf mv mf mf submit submit tar user tar submit user tar user tar user mail hw7 submission dewey cs user submit test mf tar test tar mf test tar test tar test mail hw7 test dewey cs test line subject sudden death cse326 geoduck subject hw7 interesting efficiency idea martin tompa tompa geoduck cs washington student office hour today good idea speeding encoding path huffman tree time encode character build table character encodings time build huffman tree table tree encoding encoding time small constant character simple table lookup time big alphabet size part hw7 solution thought interested cse326 geoduck subject office hour monday 12 9 martin tompa tompa geoduck cs washington change office hour coming monday 1 30 2 20 3 30 feel free make appointment chances dropping time make martin cse326 cs washington subject eof reply message thu 05 dec 1996 21 26 56 pst pine ult 3 95 100000 grizzly cs washington brian dewey dewey cs washington check end file condition eof stream correct wrong cse326 cs washington subject hw7 reply message thu 05 dec 1996 23 16 58 pst pine ult 3 95 100000 lynx cs washington brian dewey dewey cs washington read frequency list file type keyboard thing don read file read file easy top file include fstream void fstream stuff file char ch int ch writing top head haven stream library details started treat cin cout knowledgeable streams corrections post cse326 cs washington subject thought makefile reply message fri 06 dec 1996 09 15 54 pst brian dewey dewey cs washington make submit test home failed suggestion make send dewey cs washington cs aha excellent point plan make submit cs department computer ll change mail address gave abbreviated form works department ll department computer ignore rest message change lines submit submit tar user tar submit user tar user tar user mail hw7 submission dewey cs user submit test mf tar test tar mf test tar test tar test mail hw7 test dewey cs test submit submit tar user tar submit user tar user tar user mail hw7 submission dewey cs washington user submit test mf tar test tar mf test tar test tar test mail hw7 test dewey cs washington test cse326 cs washington subject separate file reply message fri 06 dec 1996 10 39 17 pst pine ult 3 95 100000 lynx cs washington brian dewey dewey cs washington brian separate class file main cc test include class files easier put driver simplify sending mail put information separate files make things easier manage terminate loop frequency dat file ends check end file earlier post diane cs washington brian dewey dewey cs washington cc cse326 cs washington subject hw7 reading doubles ints diane cs washington undergraduate computer science university washington fri 6 dec 1996 brian dewey wrote read frequency list file type keyboard thing don read file read file easy top file include fstream void fstream stuff file char ch int ch writing top head haven stream library details started treat cin cout knowledgeable streams corrections post cse326 cs washington subject clarification brian dewey dewey cs washington cut paste program remember won reading characters ints file characters doubles cse326 cs cc dewey cs washington subject make submit test reply message sat 07 dec 1996 18 09 03 pst pine ult 3 95 100000 lynx cs washington brian dewey dewey cs washington problems make separator rules line 10 stop problem makefile reformatted slightly whitespace mailed test type cp makefile copy copy makefile current directory command works wolf grizzly lynx ll edit file work doesn cse326 cs cc dewey cs washington subject multiply defined reply message sat 07 dec 1996 23 06 38 pst pine ult 3 95 100000 wolf cs washington brian dewey dewey cs washington separate stuff separate cc files ll put lines int bs initial size 1 int bits char 8 cc file file file problems bs initial size multiply defined bits char multiply defined main bs initial size multiply defined main bits char multiply defined cse326 cs subject sample input brian dewey dewey cs washington including sample session program homework 7 results similar mine number compressed bits approximate mine dealing exact frequencies letters input variation number compressed bits significantly wrong close good shape brian dewey cse326 homework 7 string encode enter string lowercase letters spaces periods terminate string return quick brown fox jumps lazy dog compressed length 206 sanity check restored string quick brown fox jumps lazy dog string encode enter string lowercase letters spaces periods terminate string return string lowercase letters spaces periods compressed length 259 sanity check restored string string lowercase letters spaces periods string encode enter string lowercase letters spaces periods terminate string return time good men aid country compressed length 304 sanity check restored string time good men aid country string encode enter string lowercase letters spaces periods terminate string return fire ready adm george dewey compressed length 244 sanity check restored string fire ready adm george dewey string encode cse326 cs subject huffman tree reply message fri 06 dec 1996 18 44 45 pst pine ult 3 95 100000 wolf cs washington brian dewey dewey cs washington mentioned quiz section wanted confirm don print huffman tree don work demonstrate building huffman tree properly debugging requirement jason cs washington brian dewey dewey cs washington cc cse326 cs washington subject sample input brian ball park substantially compression length numbers tree built differently ve smaller compression larger correctly compare length letters scheme length 161 jason gdb 4 14 mips dec 2 copyright 1995 free software foundation gdb run starting program homes 326 hw7 exe jason cse326 homework 7 string encode enter string lowercase letters spaces periods terminate string return abc compressed length 16 sanity check restored string abc string encode enter string lowercase letters spaces periods terminate string return quick brown compressed length 78 sanity check restored string quick brown string encode enter string lowercase letters spaces periods terminate string return quick brown fox jumps lazy dog compressed length 218 sanity check restored string quick brown fox jumps lazy dog string encode enter string lowercase letters spaces periods terminate string return string lowercase letters spaces periods compressed length 230 sanity check restored string string lowercase letters spaces periods string encode enter string lowercase letters spaces periods terminate string return fire ready adm george dewey compressed length 236 sanity check restored string fire ready adm george dewey string encode enter string lowercase letters spaces periods terminate string return compressed length 161 sanity check restored string string encode program exited gdb sun 8 dec 1996 brian dewey wrote including sample session program homework 7 results similar mine number compressed bits approximate mine dealing exact frequencies letters input variation number compressed bits significantly wrong close good shape brian dewey cse326 homework 7 string encode enter string lowercase letters spaces periods terminate string return quick brown fox jumps lazy dog compressed length 206 sanity check restored string quick brown fox jumps lazy dog string encode enter string lowercase letters spaces periods terminate string return string lowercase letters spaces periods compressed length 259 sanity check restored string string lowercase letters spaces periods string encode enter string lowercase letters spaces periods terminate string return time good men aid country compressed length 304 sanity check restored string time good men aid country string encode enter string lowercase letters spaces periods terminate string return fire ready adm george dewey compressed length 244 sanity check restored string fire ready adm george dewey string encode alan wilson washington jason cs washington cc brian dewey dewey cs washington cse326 cs washington subject sample input numbers don bad impartial worried printing tree showing encoded string time good check things alan mon 9 dec 1996 jason wrote brian ball park substantially compression length numbers tree built differently ve smaller compression larger correctly compare length letters scheme length 161 jason gdb 4 14 mips dec 2 copyright 1995 free software foundation gdb run starting program homes 326 hw7 exe jason cse326 homework 7 string encode enter string lowercase letters spaces periods terminate string return abc compressed length 16 sanity check restored string abc string encode enter string lowercase letters spaces periods terminate string return quick brown compressed length 78 sanity check restored string quick brown string encode enter string lowercase letters spaces periods terminate string return quick brown fox jumps lazy dog compressed length 218 sanity check restored string quick brown fox jumps lazy dog string encode enter string lowercase letters spaces periods terminate string return string lowercase letters spaces periods compressed length 230 sanity check restored string string lowercase letters spaces periods string encode enter string lowercase letters spaces periods terminate string return fire ready adm george dewey compressed length 236 sanity check restored string fire ready adm george dewey string encode enter string lowercase letters spaces periods terminate string return compressed length 161 sanity check restored string string encode program exited gdb sun 8 dec 1996 brian dewey wrote including sample session program homework 7 results similar mine number compressed bits approximate mine dealing exact frequencies letters input variation number compressed bits significantly wrong close good shape brian dewey cse326 homework 7 string encode enter string lowercase letters spaces periods terminate string return quick brown fox jumps lazy dog compressed length 206 sanity check restored string quick brown fox jumps lazy dog string encode enter string lowercase letters spaces periods terminate string return string lowercase letters spaces periods compressed length 259 sanity check restored string string lowercase letters spaces periods string encode enter string lowercase letters spaces periods terminate string return time good men aid country compressed length 304 sanity check restored string time good men aid country string encode enter string lowercase letters spaces periods terminate string return fire ready adm george dewey compressed length 244 sanity check restored string fire ready adm george dewey string encode jason cs washington cc cse326 geoduck subject encoding length martin tompa tompa geoduck cs washington forwarded message jason cs washington brian dewey dewey cs washington cc cse326 cs washington subject sample input brian ball park substantially compression length numbers tree built differently ve smaller compression larger correctly compare length letters scheme length 161 end forwarded message looked obvious 161 encoding length string prove found counterexample lesson importance proving obvious things clarify issue people encoding lengths string algorithm answer encoding length depend tree building algorithm breaks ties counterexample smaller alphabet suppose alphabet frequencies 1 1 2 2 start making siblings choice point 3 trees weight 2 encoding trees end encoding length abcd case 8 case 9 huffman algorithm supposed produce optimal encoding tree suboptimal encoding case answer sample string abcd doesn frequencies promised built tree notice string promised frequencies encoding length 12 cases correct frequencies hw7 28 letter alphabet long test string cse326 cs subject sample input reply message mon 09 dec 1996 09 42 08 pst pine ult 3 95 100000 grizzly cs washington mime version 1 0 content type text plain ascii brian dewey dewey cs washington number compressed bits significantly wrong close good shape close give range moment martin earlier mail theoretical reasons practical reason chance subtle flaw program tough program longer dozen lines totally correct treat test results gospel fairly answers optimal answers answers playing game bottom line correct implementation purposes assignment algorithms discussed book encode strings produces original input incorrect program flaw implementation algorithms clues flaw program 1 unable decode 2 properly decode encoding lengths samples flying mailing list data students means built encoding tree picking subtrees minimum frequency step notice 2 symptom problem cases generate shorter encodings samples ve cases longer lose points varying test data variation caused bug eugene shih eugene cs washington cse326 cs washington subject sample input numbers agree jason alan 1 quick brown fox jumps lazy dog 218 bits 2 string lowercase letters spaces periods 230 bits 3 fire ready adm george dewey 236 bits eugene cse326 geoduck subject 2 martin tompa tompa geoduck cs washington bring 2 pencils class today wednesday ll evaluations days depending timing lectures cse326 cs washington subject optimal comparison brian dewey dewey cs washington interest providing exact numbers created script runs homework 7 program string distribution characters told program produce number bits string script assumes stick input model driver string encode read string repeat user answers questions ll figure change script make work program wolf grizzly lynx type command hw7 exe test script tells computer run hw7 exe answers questions file test script home directory generate encoding 5057 bits run notice answers input prompts don file keyboard 20 lynx hw7 hw7 exe test script brian dewey cse326 homework 7 string encode enter string lowercase letters spaces periods terminate string return compressed length 5057 sanity check restored string string encode 21 lynx hw7 cse326 geoduck subject 5057 bits martin tompa tompa geoduck cs washington forwarded message brian dewey dewey cs washington cse326 cs washington subject optimal comparison generate encoding 5057 bits end forwarded message providing testbed brian interest obvious encoding 5 bits character 5 log 2 28 6050 bits encode brian test string huffman savings 16 don worry constant factors 326 jason cs washington dewey cs cc cse326 cs subject script bomb brian program calculates length correctly 5057 reason input script appears driver bomb statement return 0 crashing clean large input encountered command line gdb transcript jason gdb run test script starting program homes 326 hw7 exe test script jason cse326 homework 7 string encode enter string lowercase letters spaces periods terminate string return compressed length 5057 sanity check restored string omitted clarity messages string encode program received signal bus error io default finish fp 505 505 file directory current language auto gdb bt 0 io default finish fp 505 1 3 cc 214 2 ios 0 465 3 ifstream 2 fstream 1 4 main main 112 gdb fragment driver code bomb cout compressed length encoding endl cout sanity check restored string insert invocation decode print cout root encoding cout cout endl cout string encode cin answer repeat delete encoding return 0 line 112 bus error cs washington brian dewey dewey cs washington cc cse326 cs washington martin tompa tompa geoduck cs washington subject input 256 char problem input 256 characters rr rr cs washington http www cs washington homes nice day hall washington reply hall washington cse326 cs washington subject problem files program dies point declare ve ifstream open frequency dat ifstream frequency dat works suggestions mike shafer shafer cs washington hall washington cc cse326 cs washington subject problem files opened mine ifstream ch freq txt ios hope helps mon 9 dec 1996 hall wrote program dies point declare ve ifstream open frequency dat ifstream frequency dat works suggestions hall washington mike shafer shafer cs washington cc cse326 cs washington subject problem files problem douglas beal cs washington reply douglas beal cs washington cse326 cs washington subject problem files ifstream fin frequency message give dies core dump doug mon 9 dec 1996 hall wrote program dies point declare ve ifstream open frequency dat ifstream frequency dat works suggestions jason cs washington hall washington cc cse326 cs washington subject problem files include ing iostream fstream headers top file top file include iostream include fstream include stdlib const char freq file frequency dat ifstream freq file ios cout open freq file endl exit 1 jason mon 9 dec 1996 hall wrote problem jason cs washington cs washington cc cse326 cs washington subject input 256 char similar problem reported list kind error jason mon 9 dec 1996 wrote problem input 256 characters rr rr cs washington http www cs washington homes nice day cs washington brian dewey dewey cs washington cc cse326 cs washington subject optimal comparison bits 5057 mon 9 dec 1996 brian dewey wrote interest providing exact numbers created script runs homework 7 program string distribution characters told program produce number bits string script assumes stick input model driver string encode read string repeat user answers questions ll figure change script make work program wolf grizzly lynx type command hw7 exe test script tells computer run hw7 exe answers questions file test script home directory generate encoding 5057 bits run notice answers input prompts don file keyboard 20 lynx hw7 hw7 exe test script brian dewey cse326 homework 7 string encode enter string lowercase letters spaces periods terminate string return compressed length 5057 sanity check restored string string encode 21 lynx hw7 cs washington jason cs washington cc cse326 cs washington subject input 256 char put brian code file moved encode decode code main tree function started working fine btw auto deleting destructors stuck day mon 9 dec 1996 jason wrote similar problem reported list kind error jason mon 9 dec 1996 wrote problem input 256 characters rr rr cs washington http www cs washington homes nice day rr rr cs washington http www cs washington homes nice day cs washington cs washington cc brian dewey dewey cs washington cse326 cs washington subject optimal comparison martin question code martin confident 5057 number students lab similar problems common variable found compiler home mon 9 dec 1996 wrote bits 5057 mon 9 dec 1996 brian dewey wrote interest providing exact numbers created script runs homework 7 program string distribution characters told program produce number bits string script assumes stick input model driver string encode read string repeat user answers questions ll figure change script make work program wolf grizzly lynx type command hw7 exe test script tells computer run hw7 exe answers questions file test script home directory generate encoding 5057 bits run notice answers input prompts don file keyboard 20 lynx hw7 hw7 exe test script brian dewey cse326 homework 7 string encode enter string lowercase letters spaces periods terminate string return compressed length 5057 sanity check restored string string encode 21 lynx hw7 rr rr cs washington http www cs washington homes nice day eugene shih eugene cs washington cs washington cc brian dewey dewey cs washington cse326 cs washington subject optimal comparison reason bits 5057 huffman tree incorrect suggest importing display function hw 5 tree 28 leaves leaf unique mon 9 dec 1996 wrote bits 5057 douglas beal cs washington brian dewey dewey cs washington cc cse326 cs washington subject compiling linux commented dec running ultrix osf 1 line suffixes version makefile don worry cse326 request cs washington update 12 10 96


3084 wife married september 1992 decided spend spent wonderful days island hit hurricane class 5 hurricane winds 160 mph hotel destroyed fortunately elementary school turned red cross shelter remainder stay spent friendly elementary school grade classroom 15 20 adults lots vivid memories trip including sight bunch 20 60 year hanging classroom sitting tiny chairs made 7 year play cards light neon stick things pictures damage picture hotel note upper left unit blown completely leaving dangling electrical cord storm lots low lying areas foliage island pickup truck turned guy surfboard parking lot retrieve stuff truck lots roads shore completely washed wasn running water part island days hotel 100 feet ocean waves washed pretty floor floor room note sky roof left stuff room abandoned hotel shelter back weren optimistic condition turned fine bit muddy bed floor elementary school classroom provided shelter hurricane young agile enabling claim corner spot floor 130 island days hurricane people 130 huh experience won forget jdean cs washington


personal information picture graphics support valley spring 1994


cse 473 assignment 5 due monday april 29 class note april 26 announcement home page info turn monday reading chapter 5 read pages 241 250 chapter 6 read pages 271 302 part 1 exercises end chapter 6 exercises 1 2 13 15 part 2 mini project class puzzles puzzles involve placing pieces called naturally shapes order fill gaps overlaps made 5 squares attached sides 12 distinct shapes counting rotated flipped versions classical puzzle fill 6 10 rectangle 12 pieces general 5 case 1 2 design representation states puzzle easily changed programmer parameter create search program solves problems user give shape empty tray filled list filling tray assume run number squares assume necessarily shapes sized board large program handle reasonable amount time create user interface program state shown graphically screen user idea search progressing statistics updated real time screen optional make heuristics prune guide search implement algorithm heuristic tanimoto cs washington


securing hardening horus system joint project researchers horus nuprl projects cornell university transis project hebrew university jerusalem overview horus adaptable multi purpose group communication toolkit building secure fault tolerant applications horus modular lego architecture tiny protocol layers composed run time protocol stacks rich sets properties horus includes forty protocols composed large number combinations varying properties performance characteristics img diagram horus group architecture 8k gif image img diagram layered communication protocols horus 12k gif image security infrastructure extending horus flexible communication architecture protocols implement multi level security architecture architecture applications made secure inserting standard protocol layers communication stacks work involves incorporating previous security research horus framework developing protocols techniques collaboration hebrew university jerusalem img detailed plans horus security infrastructure validating horus protocols important part horus effort validating correctness security fault tolerance protocols methodology validating horus protocols involves steps 1 reference implementation system built ml programming language implementation compiles production implementation 2 horus protocols temporal logic 3 small 200 lines ml protocol layers imported directly nuprl proof development system formally verified img detailed plans validation horus timeline schedule project runs september 1995 september 1998 img diagram timeline project 9k gif image contact img kenneth birman cornell horus img robbert van renesse cornell horus img danny dolev hebrew university transis img robert constable cornell nuprl copyright thu apr 25 23 42 32 edt 1996 cornell university maintained david karr send corrections karr cs cornell


3333 java measurements x86 page set measurements sun java 1 0 interpreter executing pentium pro running windows nt originally measured java x86 platform java interpreter alpha platform consistency asplos vii paper switched alpha java port x86 measurements make interested interested tool collect measurements x86 etch home page tables figures roughly correspond tables figures appeared final version asplos vii paper tables figures submitted version paper presented slightly format final version system performed measurements 150 mhz pentium pro workstation running windows nt 3 51 microbenchmarks java interpreter compiled microsoft visual 4 0 note java measurements x86 system measurements interpreters alpha system table 1 results table shows slowdown relative equivalent operation implemented ran seconds trial number presented average 20 runs standard deviations 10 5 table 2 table shows baseline performance measurements interpreters running set representative programs benchmark programs written fetch decode column shows percentage native instructions due fetching decoding virtual commands native instructions virtual command simply total number instructions executed divided number virtual commands includes fetch decode overhead program overheads figures 1 2 figures final paper compiled data shown graphs java native instruction count distributions categories java virtual commands category represents total number native instructions executed interpreting virtual commands category execution phase successive categories cumulative respect previous categories percentage category denotes number times virtual commands category executed percentage virtual commands executed figures 3 4 results figure 3 don pentium pro simulator perform equivalent experiment similarly perform cache simulations java executing x86 rocky cs washington


introduction computer graphics 1996 autumn quarter class cs ce major satisfied prerequisites sign directly satisfied prerequisites cs ce major coming class fewer 42 people signed 42 signed coming class hope students drop


ingram softbot project ingram information gathering agent called ingram user information terms database query ingram kinds methods unlike internet hunt obtain information ingram similar projects ways ingram designed small efficient distributed eventually reside web java application dream core ingram forward chaining planner occam occam performs heuristic search database objects occam joint work dan weld recently authored paper occam accepted aaai96 publications planning information gathering technical report planning gather information accepted aaai 96 coming attractions model sites modeling commercial sites index browse future fantasy bookstore home page geographical weather infinite ink finding writing distributing faqs library congress world wide web home page mailing list www gateway npr online nynex interactive yellow pages home page netfind search reference telephone directories web world wide web virtual library subject catalogue virtual wordsworth complete discount home page news master page isn netlib home page related systems information manifold sims context interchange project softbots uw rodney simon cody kwok modified feb 1


4603 cs 766 hw 2 hints faqs weights mask defined weights based values 4 25 0 05 scaled integer arithmetic floating point convolution operation good 1d convolution mask 1 4 6 4 1 result multiplying 1 16 obtain answer correctly result mask pixel rounded result computed 8 16 division subtract images pixel wise difference operation resulting image create input images approximately match scale splining creates cool image initially scaling input images splined result interesting laplacian images positive negative values range 255 255 store images practice pixels values close 0 introduce error truncate laplacian values 128 greater 127 store image byte pixel vista type integer arithmetic operations performed avoid losing precision integer division operation compute rounded result 2 windows input images determined images arbitrary sizes aligning center pixels input images area overlap make left image window image centered center point similarly construct image input image images input programs stopping level pyramid 1 images size 2 1 2 1 introduce artifacts expand operation defined 4 formula answer question expand showing implementations incorrect implementation tmp 0 2 2 2 2 tmp tmp image row 2 col 2 store tmp correct version tmp 0 2 2 2 2 row mod 2 0 col mod 2 0 tmp tmp image row 2 col 2 store 4 tmp correct version suppose row column 10 window input image row values 10 2 2 10 2 10 2 2 column values 10 2 2 10 2 10 2 2 25 weights kernel weights locations turn 1600 summing 0 25 multiply result 4 effective sum weights 1 incorrect version assuming row column effectively truncating row 2 col 2 2 2 instance computed row index 0 1 row 2 row 1 2 window input image values window repeated effective weights window 0900 1950 1950 summing 1 0 weight window burt adelson weights row odd column similarly compute effective weight matrices results similar algorithms correct version pixel values larger output image neighborhood smaller input image makes sense symmetric gaussian weight matrix


001 050 051 100 101 150 151 200 abstracts abstracts ps abstracts txt ps refer txt readme test


derrick weathersby derrick cs washington computer science engineering department university washington fr 35 seattle wa 98195 usa research interests parallel languages compilation partial evaluation specialization projects activities zpl data parallel array sublanguage derrick weathersby modified tue 2 1994


netrek java project hiep nguyen http www cs utexas users hiep html table contents proposal netrek java methodology java drawbacks working helping signing suggestions related web sites proposal propose gradual porting migration java client code netrek popular interactive multi user video game internet netrek run applications platforms running java netscape hotjava solaris windowsnt goal produce pure java application graphics networking security features java develop methodology gradual code porting java project demonstrate java handle interactive networked application real time graphics result impressive video game world wide web netrek netrek popular real time networked video game internet wide user base excellent demonstration networking graphics capabilities simple graphics engine crucial graphics run fast commercial video games written networking mind true speed bottleneck game netrek communication netrek client server netrek ported times platforms modular structure present gradual code porting stage code port involve writing graphics wrapper java netrek graphics engine keeping code number files functions netrek client trivial good test java handles large application netrek java java portable code updated users download clients release graphics true images bitmaps gif ships planets support networking security decrease port netrek systems methodology propose gradual porting client code netrek java facilities calling native code java java graphics networking methods replace client code equivalent process involve identifying functions called java trivial instance wrapper method call function main general case put functionality java graphics networking identifying java functions replace client code testing functionality client code migration file java functionality netrek remain repeat process code ported java porting broken 3 main phases port graphics engine java port networking engine java port rest files java java drawbacks questions project answer directly relevant java test drawbacks java speed video game drawback speed speed drawback starting game client downloaded user starts game browser hotjava turned speeding process considerably invocation netrek speed problem graphics engine clear fast java graphics sparc station speed platforms macintosh windowsnt hardware speed problem reduced project test graphics capabilities java speed problem networking engine netrek methods smaller fewer packets order increase speed reduce lag java security consideration security netrek rsa security java provide comparable security security features java strict forcing difficult work size code drawback size java client small fit platforms client code resources making multitasking tasks netrek impossible smaller systems pc working people working project jason jason fisher psych uh spencer bishop cs utexas stephen paul carl esteban cs utexas amanda chou cs utexas alec astro indiana charles herring herring ncsa uiuc ted ted craig craig eng sun comet lbl gov bach nguyen ix netcom hiep nguyen hiep cs utexas gopher chem wayne matthew pearson m3 forgot email hiep cs utexas helping project terms time knowledge comments suggestions money greatly appreciated project suited interested java web programming real time video games internet email hiep cs utexas comments suggestion sign project related web site document http www cs utexas users hiep htm java page http java sun netrek page http virtual reality vrml page http www sdsc vrml


home page home page sigda university booth 1995 design automation conference sponsored acm ieee held san francisco california june 12th 16th university researchers providing demonstrations cad algorithms exhibition floor industry won giving shirts coffee trips bahamas worth visit visiting check demos won charge admissions fee advertising flyer dac bags possibly advertising flyer summary demo schedule schedule demo times tabular schedule give demo university booth fill registration form demos research presented dac university research related da field registered information interest bringing equipment university booth ll map showing 70 marshalling yard stop loading pass click send email pickle cs ucla


people design research institute frank adelstein harry lois brown mike cavanaugh jim davis hrishikesh dixit srikanth kannapan matthew morgenstern liu greg zack


utcs nn research group statistics history 05 26 96 01 04 97 skip weekly reports totals nn home page 8 783 accesses 20 bytes alumni 358 accesses 419 004 bytes archives 268 accesses 787 960 bytes bias unit 301 accesses 641 435 bytes conferences 1 accesses 1 262 939 bytes demos 768 accesses 1 271 248 bytes tools 263 accesses 387 404 bytes graduate students 606 accesses 772 182 bytes home pages world 926 accesses 775 360 bytes information sources 471 accesses 2 556 bytes lateral interactions book 18 680 accesses 113 100 381 bytes newsgroups 196 accesses 387 625 bytes software 1 299 accesses 2 195 316 bytes publications 661 accesses 721 956 bytes user guide 2 542 accesses 4 979 185 bytes reports reports year 1996 martym cs utexas