university wisconsin madison computer sciences alumni group www home page relevant information alumni uw cs alumni group launched 1993 order encourage strong connection past present members department department supports alumni directory published annually printed directory address employment information alumni choose share information alumni newsletter badger bytes published year printed newsletter reports news department alumni alumni email list email list announce job postings items general interest uw cs alums submit item alumni email list email alumni cs wisc line options note web viewer capable handling forms forms display properly viewers layout problems mosaic microsoft windows advice improving email alumni cs wisc reporting news alumni group newsletter changing address joining alumni group fees uw madison links uw madison cs dept uw madison school letters sciences uw madison graduate school uw madison wisconsin alumni association information contact email cs wisc alumni coordinator email alumni cs wisc phone 608 263 dept phone 608 262 1204 fax 608 262 9777 person room cs stats building mail cs dept 1210 dayton st madison wi 53706 changed march 29 1996 alumni cs wisc


solutions homework 1 question 2 1 cost effectiveness performance dollar cost performance depend workload choice cost effectiveness measured numbers executions dollar machine cost executions dollar executions dollar s1 executions dollar dollars system 2 cost effective ratio question 2 2 method previous part execution time sum execution times executions dollar s1 executions dollar system 1 slightly cost effective factor question 2 3 problem finding amount time program 2 run hour executions throughput measure executions p2 hour executions p2 hour s1 executions p2 hour conclude higher throughput cost run hour p2 dollars s1 18 76 23 07 s1 cost effective workload question 2 27 harmonic hm times times hm state machine schematic solution state machine problem waveform simulation schematic account ece552 thu sep 12 15 55 17 cdt 1996


1652 picture bio page graduate student computer science department uw madison uw madison astronomy math jobs astronomy looked decided path comp sci courses special student 5 semesters part time comp sci master program wife refused picture remotely web page cats inclined cats picture cats ra bit hard make picture bit ra ra years preventing studying enjoys ignoring sitting wife lap drinking milk glass paw attempt eat toaster picture ra addition family enjoy making difficult brush incredibly long hair demanding attention times night stealing cat treats ra finished picture back main page


home pages links home pages number cs courses cases class notes problem sets information registered members cs100 introduction computer programming introduction elementary computer programming concepts emphasis techniques problem analysis development algorithms programs subject programming programming language principal programming language presume previous programming experience programming assignments tested run interactive stand microcomputers cs211 computers programming intermediate programming high level language introduction computer science topics include program development proofs program correctness program structure recursion abstract data types object oriented programming data structures analysis algorithms principal programming language cs212 structure interpretation computer programs challenging introduction programming languages computer science topics include recursive higher order procedures performance analysis algorithms proofs program correctness probabilistic algorithms symbolic hierarchical data abstract data types polymorphic functions object oriented programming infinite data types simulation interpretation compilation programs cs222 introduction scientific computation introduction elementary numerical analysis scientific computation topics include interpolation quadrature linear nonlinear equation solving squares fitting ordinary differential equations matlab computing environment vectorization efficiency reliability stability stressed special lectures parallel computation high performance fortran cs314 introduction digital systems computer organization web material includes info lecture notes homeworks project info lecture videos topics covered include representation information machine assembly languages powerpc processor organization interrupts memory hierarchies combinatorial sequential circuits data path control unit design rtl microprogramming cs410 data structures lists trees graphs arrays forms data structure implementation relationship language data structure emphasizing abstract data types dynamic storage allocation memory management detailed study searching sorting methods analysis determine efficient algorithm situation cs417 computer graphics visualization introduction principles interactive computer graphics scientific visualization topics include surface modeling animation perspective transformations hidden line hidden surface algorithms lighting models image synthesis application scientific data analysis cs418 practicum computer graphics programming assignments dealing interactive computer graphics visualization scientific data cs432 introduction database systems credit covers fundamentals database systems information retrieval database part deals traditional structured data relational model main model part information retrieval part concentrates manipulate textual information largely unstructured cs482 introduction analysis algorithms techniques creation analysis algorithms combinatorial algorithms computational complexity np completeness intractable problems cs512 advanced language implementation class survey modern techniques efficient implementation advanced programming languages sml java haskell scheme modula 3 cs514 practical distributed systems practical issues designing implementing distributed software topics include local wide area network protocols replicated data dynamic reconfiguration monitoring reacting failures distributed computation synchronization techniques expressing coarse grained parallelism application level cs515 practicum distributed systems java enabled browser animated text scrolling practical aspects distributed systems studied design implementation significant system projects area distributed agents network resource management fundamental network protocol research hot network protocols real time communication distributed virtual reality java distribution java applications cscw distributed simulations distributed data management distributed multiplayer games cs516 high performance computer systems java enabled browser animated text scrolling discusses design high performance processors including techniques superscalar risc processors 64 bit instruction set extensions cache coherency processors cs516 web page lecture notes problems sets readings electronically term progresses projects software design high performance architectures sophisticated software technology required exploit enormous computing power modern high performance architectures pipelined vliw superscalar parallel architectures objective study architectures master compiler runtime systems technology required deliver high performance applications programmer emphasize technology relevant computational science applications dense sparse matrix techniques iterative direct solvers examples cs664 machine vision introduction computer vision topics include edge detection stereopsis motion optical flow extracting shape images students implement algorithms covered addition research project cs674 natural language understanding introduction natural language understanding subfield artificial intelligence primary concern computational study language covers aspects natural language processing including semantic interpretation syntactic analysis discourse processing text summarization natural language generation language acquisition knowledge acquisition memory models statistical methods ambiguity resolution seminar natural language understanding covers current topics natural language understanding computational linguistics relevant areas machine learning meets week 1 2 hours present discuss recent papers field ongoing natural language understanding research department information previous semesters information previous semesters retained don surprised links don work fall 1994 spring 1995 summer 1995 fall 1995


professor nell dale personal interests area home pages construction direct correspondence mail account ndale cs utexas back main page nell dale 1200 westlake dr austin tx 78746 fax office 512 471 8885 document created assistance services


howdy dammit big 12 contest el page page visiting


cse 473 topic list final exam common lisp evaluation expressions involving 1 cons list append rest null 2 setf apply quote defun progn lambda production systems pattern matching 1 unordered ordered production systems 2 discrimination nets knowledge representation 1 isa hierarchies partial orders 2 propositional calculus truth tables rules inference 3 predicate calculus 4 formed formulas 5 semantics interpretations models 6 quantification representation unique existence state space search 1 computing size state space painted squares puzzle 2 iterative formulation depth search 3 breadth search search uniform cost search 4 search algorithm 5 genetic search logical reasoning 1 proofs propositional calculus perfect induction 2 resolution propositional calculus 3 satisfiability tautology contradiction propositional calculus 4 predicate calculus literals clauses 5 reduction clause form 6 unification general 7 predicate calculus resolution 8 satisfiability tautology contradiction predicate calculus probabilistic reasoning 1 bayes rule 2 odds commonsense reasoning 1 case based reasoning approach problem solving 2 distance functions distance metrics planning 1 difference world space plan space 2 iterative deepening depth search learning 1 learning improvement measured function merit 2 concept synthesis theory formation prime numbers natural language understanding 1 levels nlu acoustic pragmatic 2 semantic grammar vision 1 edge detection roberts cross operator 2 representing contours chain codes 3 hough transform works main formula 4 medial axis transform skeleton 5 algorithm polygonal approximation 6 method labelling line drawing blocks neural networks 1 perceptrons 2 fundamental training theorem perceptrons tanimoto cs washington


quiz reviews cs quiz 1 review windows email quiz 2 review word quiz 3 review excel quiz 4 review paradox vocabulary words exams return home page


previous contents contents implementing multi level queries database environment vision rex jakobovits linda shapiro steven tanimoto department computer science engineering fr 35 university washington seattle washington 98195 abstract database environment vision research devr entity oriented scientific database system based hierarchical relational data model hrs paper describes design implementation data definition language application programmer interface query mechanism devr system devr dynamic data definition language modeling image vision data integrated existing image processing vision applications schema definitions fully interleaved data manipulation requiring recompilation addition devr powerful application programmer interface data access schema definition maintains indexes enforces type safety data integrity system supports multi level queries based recursive constraint trees set hrs entities type filtered network constraints parts properties relations type queries constructed interactively menu driven interface dynamically generated vision application programmer interface query objects persistent reusable users libraries query templates built incrementally tested separately linked form complex queries contents introduction hrs data model components hrs application tribors implementing hrs schema class entity class application programmer interface query system query model constraint trees implementation query model conclusion references document postscript rex jakobovits mon jan 16 19 29 35 pst 1995


cs395t mining monitoring databases prof daniel miranker world wide herbarium demo world wide herbarium report class assignments homework 1 presentation presentation world wide herbarium project team members blue team 1 francois 2 3 dionisis query ability report line university texas tamu biology herbarium collection swedish museum natural history herbarium flora database institute botany academia sinica taipei charles graves herbarium mich query usda plants database uc berkeley project harvard grey herbarium botany resources projects mark ng alvin lo siew yee lee construction


common programming errors page list common coding errors legal code unexpected behavior suggestions list send email skrentny cs wisc common errors ordered categories basics control structures basic data structures functions basics case isn case isn case case sensitive make identifiers convention follow constants initial cap type names lower case variable names typedef float case const case case 22 0 case case case dividing division time operands division op integral types integers operation number division fractional division change operands type casting real number float double fractional division code displays 5 5 5 5 int 11 2 float cout float endl true false nonzero means logical true 0 false compiler bool type values true false booleans supported preferred type enumerated boolean type shown text integers 0 1 simple bool cc enumerated type include boolean shown text compiler warning message cities locals variables created defined destroyed fall scope places variables defined code block limits variables scope int cout int scope limited code block cout falls scope cout error doesn exist falls scope leading zeros confusing numbers leading zeros treated octal base 8 decimal base 10 code displays 81 121 int 121 cout endl character values enclosed single quotes strings enclosed double quotes terminated null character code give syntax error control structures equal common error assignment op equality op assignment legal equality comparison desired error create syntax error assignment equality expected comment code assignment intentional apples oranges oops intentional equality comparisons logical logical symbol doubled space greatest greater great sequence comparisons made compare things time join comparisons logical conditions good evaluate false 33 22 11 33 22 22 11 11 11 11 11 11 11 11 problem single statement body control structures compound statements statement block good practice apples oranges cout dangerous endl cout thing endl thing break break break statement follow case switch statement intend flow case good practice put break case switch menu choice case intentional flow case case add item accidental flow case case intentional flow case case delete item break good practice loop misplaced semicolon loop examples loops null body due extra semicolon compiler won complain 0 max extra semicolon max extra semicolon scoping counters scoping rules loops changed ansi rules generating warning messages programs mix styles results syntax errors detail code recommend eliminate problems loop counters loop body defined loop int 1 1 11 cout counter loop body cout endl endl loop counters inside loop body defined loop manner shown defines local counters inside loop int 1 1 11 cout style defining loop counters give syntax errors avoided notice int int 1 int 1 11 cout basic data structures start indexing 0 array indices begin 0 creates array 11 elements index 0 index 10 int 11 0 121 11 1331 error index 10 bounds prevent indexing bounds array program intermittently crash compiler doesn verify indices range programs compile bad indices element elements multidimensional arrays accessed legal comma operator evaluates operand results hand operand means access element dimensional array intended arrays unlike data types int char structs arrays default passed functions reference returned function return statement classes end semicolon don forget end class definitions semicolon class don forget functions mismatched arguments formal arguments listed function header prototype match order number type mismatch syntax error compiler undefined symbol error linker additionally reference constant arguments match arguing parentheses function takes arguments include calling function prototype function header leaving parentheses syntax error function refers function address shows void display int main display oops doesn call function int display cout endl arrays troubles copyright 1996 james skrentny skrentny cs wisc


ed life unlike people computer science department born seattle lived seattle life brother sister bunch cousins bigger bunch cousins mount rainier high school 2nd graduating class participate international baccalaureate ib diploma program older brother graduating class ib classes yale undergraduate degree computer science mathematics related links curious roommate sam rubin ll working haven minor league baseball team helped design official home page picture hidden inside links yale home page fortunately deleted home page including picture eventually download mac program wrote runs powerpc shareware game figure


img resource bounded reasoning research group department computer science university massachusetts box 34610 lederle graduate research center amherst ma 01003 4610 voice 1 413 545 4189 fax 1 413 545 1249 personnel personnel research publications principal investigator symposia shlomo zilberstein talks affiliations administrative assistant michele roberts graduate students balakrishnan ashok victor joshua grass eric hansen undergraduate research assistants yaron koren shlomo cs umass


cse 573 project page notes focus problems prodigy bw prodigy sussman init flat tire 1 3 5 prioritize 1 important encoding working simplest subset action language files projects ai planners ucpop domains clean files simple ucpop data showing system works encoding 2 testing effect speed encoding variation kautz splitting overloaded splitting 3 lower priority back handling expressive action language code find solution planning problem necessarily shortest optimize speed planner length plan constants problem goal initial state ucpop results 0 3 1 0 0 0 0 0 0 0 12 12 0 3 prodigy sussman 1 0 0 0 0 850 0 0 0 6 6 515 272 0 3 1 1 0 0 0 0 10 0 0 0 1 1 3 2 0 3 3 1 0 0 0 0 10 0 0 0 3 3 11 8 0 3 5 1 0 0 0 0 10 0 0 0 5 5 19 14 key bottom page find results projects ai 573 project results team pages 1 masters linear 2 linear 3 parallel 4 kosher sushi parallel linear 5 lawrence 6 causal 7 causal input language system handle subset ucpop adl domain descriptions goals preconditions conjunction disjunction negation existential quantification conditional effects addition standard conjunctive effects universal reason side effects primary effects handle universal quantification side effects primary effects procedural attachment facts domain axioms safety constraints click input language bnf projects ai planners domains ucpop clean files simple partial problems written format output specifications outputs experiment files understandable human perl lisp filenames info data info file items white space blank fields group experiment encoder switches encoder solve switches solve program decoder switches decoder machine machine type comment data file line run separated whitespace fix maximum number encode solve decode run planning problem numerous rows put column parentheses quotation marks columns group number experiment number caps max time steps fixed encoding success number clauses number variables number literals elapsed time encoding elapsed time solving elapsed time decoding solve fails flips assign part solve output restarts assign part solve output number time steps plan produced ignores number steps plan produced time steps parallel number plans created ucpop number plans visited ucpop results results projects ai 573 project results


leave city state country mail address submit message reset form visiting img back home page


ai labs ai funding agencies arpa bell labs canadian national research council cmu ai repository jair journal artificial intelligence research microsoft research mit artificial intelligence lab mit lab computer science nasa home page nasa ames research center nasa johnson space center nsf robotics internet resources page mass amherst stanford knowledge systems laboratory sri international ai center university washington xerox parc


pardo brown kidding told pardo cs washington


computer science logo computer science graduate students andrew nwu pete beim beim ils nwu chip cleary chip ils nwu sharon ils nwu john ils nwu wolff dobson dobson ils nwu dupont dupont godzilla cs nwu john everett everett ils nwu ronald ferguson ferguson ils nwu eric goldstein goldstein ils nwu andrew gordon gordon ils nwu jon handler nwu joseph herman herman ils nwu philip ils nwu chris johnson johnson ils nwu michael ils nwu ils nwu sven godzilla cs nwu leone ils nwu tom godzilla cs nwu ils nwu david ils nwu yusuf nwu poole poole ils nwu michael ils nwu sandor szego szego ils nwu seth ils nwu brendon ils nwu bogdan ungureanu ils nwu jeff godzilla cs nwu christopher ils nwu michael wolfe wolfe ils nwu ivan yen ils nwu mail send comments webmaster cs nwu modified september 25 1996 back people cs home page


cse 401 compilers class home admin details details lecture notes postscript fall 95 assignments updated 11 06 96 project description original lexical structure extended lexical structure original bnf extended bnf 401admin cs washington modified 11 12 96 netscape html checked


speedup learning learning planning view paper click open book image 1 integrating ebl ilp acquire control rules planning tara estlin raymond mooney proceedings international workshop multi strategy learning pp 271 279 harpers ferry wv 1996 msl 96 approaches learning control information planning systems explanation based learning generate control rules ebl produces overly complex rules decrease planning efficiency paper presents learning approach control knowledge acquisition integrates explanation based learning techniques inductive logic programming ebl constrain inductive search selection heuristics planner choose competing plan refinements scope systems address learning control information newer partial order planners specifically scope learns domain specific control rules version ucpop planning algorithm resulting system shown produce significant speedup planning domains img 1 multi strategy learning search control partial order planning tara estlin raymond mooney proceedings thirteenth national conference aritificial intelligence pp 843 848 portland august 1996 aaai 96 research planning learning involved linear state based planners paper presents scope system learning search control rules improve performance partial order planner scope integrates explanation based inductive learning techniques acquire control rules partial order planner learned rules form selection heuristics planner choose competing plan refinements specifically scope learns domain specific control rules version ucpop planning algorithm resulting system shown produce significant speedup planning domains img 2 integrating explanation based inductive learning techniques acquire search control planning tara estlin ph proposal department computer sciences university texas austin 1996 planning systems important tool automating wide variety tasks control knowledge guides planner find solutions quickly crucial efficient planning domains machine learning techniques enable planning system automatically acquire domain specific search control knowledge applications past approaches learning control information employed explanation based learning ebl generate control rules ebl produces overly complex rules decrease improve planning efficiency paper presents learning approach control knowledge acquisition integrates explanation based learning techniques inductive logic programming learning system scope ebl constrain inductive search control heuristics planner choose competing plan refinements scope systems address learning control information newer partial order planners specifically proposal describes scope learns domain specific control rules ucpop planning algorithm resulting system shown produce significant speedup planning domains effective pure ebl approach future research performed main areas scope learning algorithm extended include additional techniques constructive induction rule utility analysis scope tested real world planning domains identified testbeds depth comparisons drawn scope competing approaches scope implemented planning system order test portability planning algorithms work demonstrate machine learning techniques powerful tool quest tractable real world planning img 3 hybrid learning search control partial order planning tara estlin raymond mooney directions ai planning ghallab milani eds ios press 1996 pp 129 140 paper presents results applying version dolphin search control learning system speed partial order planner dolphin integrates explanation based inductive learning techniques acquire effective clause selection rules prolog programs version ucpop partial order planning algorithm implemented prolog program dolphin automatically learn domain specific search control rules eliminate backtracking resulting system shown produce significant speedup planning domains img 4 integrating ilp ebl raymond mooney john zelle sigart bulletin volume 5 number 1 jan 1994 pp 12 21 paper presents review recent work integrates methods inductive logic programming ilp explanation based learning ebl ilp ebl methods complementary strengths weaknesses number recent projects effectively combined systems performance individual approaches integrated systems developed guiding induction prior knowledge ml smart focl grendel refining imperfect domain theories forte audrey rx learning effective search control knowledge axa ebl dolphin img 5 learning search control heuristics logic programs applications speedup learning language acquisition john zelle ph proposal department computer sciences university texas austin 1993 paper presents general framework learning search control heuristics logic programs improve efficiency accuracy knowledge based systems expressed definite clause logic programs approach combines techniques explanation based learning recent advances inductive logic programming learn clause selection heuristics guide program execution specific applications framework detailed dynamic optimization prolog programs improving efficiency natural language acquisition improving accuracy area program optimization prototype system dolphin transform intractable specifications polynomial time algorithms outperforms competing approaches benchmark speedup domains prototype language acquisition system chill capable automatically acquiring semantic grammars uniformly incorprate syntactic semantic constraints parse sentences case role representations initial experiments show approach construct accurate parsers generalize sentences significantly outperform previous approaches learning case role mapping based connectionist techniques planned extensions general framework specific applications plans evaluation discussed img 6 combining foil ebg speed logic programs john zelle raymond mooney proceedings thirteenth international joint conference artificial intelligence pp 1106 111 chambery france 1993 ijcai 93 paper presents algorithm combines traditional ebl techniques recent developments inductive logic programming learn effective clause selection rules prolog programs control rules incorporated original program significant speed achieved algorithm shown improvement competing ebl approaches domains additionally algorithm capable automatically transforming intractable algorithms run polynomial time img 7 speeding logic programs combining ebg foil john zelle raymond mooney proceedings 1992 machine learning workshop knowledge compilation speedup learning aberdeen scotland july 1992 paper presents algorithm combines traditional ebl techniques recent developments inductive logic programming learn effective clause selection rules prolog programs control rules incorporated original program significant speed achieved algorithm produces ebl speed problem solvers capable automatically transforming intractable algorithms run polynomial time img estlin cs utexas


abstract topic audio system technical readings time 13 15 place cornell university ithaca ny 14853 advent electronic documents makes information visual form electronic information display independent describe computing system aster audio formats electronic documents produce audio documents aster speak literary texts highly technical documents presently la tex complex mathematics visual communication characterized eye ability actively access parts dimensional display reader active display passive active passive role reversed temporal nature oral communication information flows actively past passive listener prohibits multiple views impossible obtain high level view details shortcomings severe presenting complex mathematics orally audio formatting renders information structure manner auditory display overcomes problems aster interactive ability browse information structure obtain multiple views enables active listening raman raman crl dec modified wed aug 10 18 08 31 1994


img gradesheets gradesheet assignment showing allocation marks read carefully make required things include test data correct output gradesheet list test data check program works correctly make program assignment specifications produces required output run program test data manually check results errors run program test data make works valid data advanced programming assignments asked create test data user interface provide meaningful prompts user reading values keyboard display results appropriately labelled easy understand correct fortran statements fortran statement solve problem make statements work valid input values fortran statements cover class prior due date hasn covered class shouldn program indenting neatness variable names fortran code written uppercase letters comments documentation written mixed case leave blank lines major sections program indent statements loops spaces meaningful variable names fewer characters functions subroutines arguments functions subroutines break problem simpler programs clarity efficiency arguments pass values functions subroutines global referencing common blocks specifically asked flexible modular robust efficient design program easily modified enhanced solve problem obvious straight forward manner avoid writing redundant statements include unnecessary statements sacrifice clarity efficiency documentation include comments program explain program works describe variable declarations explain major sections program work explain functions subroutines input output arguments explain sections code complex tricky copyright 1996 modified gareth bestor bestor cs wisc modified september 1 1996


jobs professor computer sciences mathematics philosophy departments university texas austin senior computing research scientist fall 1993 spring 1995 computational logic austin texas senior member technical staff 1985 1987 microelectronics computer technology corporation artificial intelligence program austin texas associate professor 1981 1985 computer sciences department university texas austin staff scientist 1981 senior research mathematician 1979 81 research mathematician 1973 78 computer science laboratory sri international menlo park california research fellow 1971 73 department computational logic university edinburgh edinburgh scotland research assistant 1970 71 artificial intelligence laboratory massachusetts institute technology cambridge mass teaching assistant 1967 70 department mathematics university texas austin texas


term projects cs537 cs537 projects involve significant amount coding familiar start early project projects predator minibase projects stand require system predator stand projects learn cs432 equivalent introductory database minibase projects projects emphasis coding established conventions documenting code code stability write code things things unstable fashion choose project 8th october encourage earlier start projects groups working project topics match projects interests background projects 2 persons find groups ideal put group case early project identify person graded individually net result predator projects predator client server dbms built research prototype main research purpose system explore techniques support large number data types extensible manner meaning extend system support fields type video image changing system significantly part predator relational database system supporting subset sql projects involve extending enhancing sql functionality involve adding support data type add opt relational query optimizer 2 persons predator query optimizer join order provided query project involves incorporating opt optimizer predator opt independent library customize design query optimizer work involve finding opt integrating predator query evaluation demonstrating query optimization simple join queries develop query plan visualization tool query execution visualization tool 2 persons purpose project build graphical tool displays query plan result query optimization displays execution plan possibly displaying computation proceeding add path function indexes 2 persons project involves good understanding indexes query processing path indexes complex indexes implemented top existing simple index functionality predator important object oriented object relational database systems project provide fully working path index capability index sql recording presence catalogs index applicable query optimization retrieving index run time project give good grasp internals query processing engines evaluate wisconsin benchmark 2 persons wisconsin benchmark industry standard dbms benchmark measure performance relational dbms project parts implement groupby features supported predator execute benchmark enhance performance extent invaluable experience plan work performance related issues real dbms evaluate tpc benchmark 2 persons tpc benchmark advanced query processing benchmark functionality benchmark predator project involve balance adding functionality benchmark queries run improving performance queries previous project good exposure practical benchmarks people care implement image data type rivl 2 persons predator elementary image data type project implement large part support images found rivl brian smith multi media system operations rotate clip overlap image implement image data type vision 2 persons predator elementary image data type project involve interacting ramin zabih incorporate feature extraction algorithms extracted image features index image data implement video data type 1 2 persons add video data type support operations defined rivl brian smith multi media system implement audio data type 1 2 persons requires knowledge audio data operations audio audio data added data type manipulation functions implement text document data type 1 2 persons add document data type nlp operations document based claire cardie work require interaction nlp people implement data type chemical molecules 1 2 persons companies huge databases chemical molecular structures research involves searching database 3 spatial matches molecules project support molecule structure data type database operations molecule based research paul schuh area project involve interactions group build language embedding predator 2 persons commercial sql system queries embedded inside host language cobol project build embedding predator sql integrate external databases predator predator extensibility mechanism query processing engines incorporated system project extend mechanism integrate external databases instance informix server predator ensure multi user functionality 1 person predator client server system implemented multi threaded server multi user nature system tested problems project fix problems demonstrate multi user capability build full sql 92 compliant parser upto level type checking transformations 1 2 persons current version sql small subset ansi standard project make ansi standard sql 92 implemented extent parsing type checking 2 persons work query transformations required project implement materialized views query caching indexed retrieval researchers suggested results queries cached executing query project provide portion functionality ongoing topic research project paper survey topic minibase projects implement trees implement hybrid hash join sort merge join implement buffer replacement policies implement tree indexes implement hash based sort based aggregation projects build data mining dbms 2 persons upto 2 groups data mining exciting area blends ai databases idea information patterns hidden database evident instance medical databases statistical patterns extracted empirical effect rules project data mining paper survey purpose project implement algorithms suggested literature perform implement data clustering algorithms 2 persons aspect data mining classify large amount data groups clusters based properties point efficiently algorithms proposed literature project involve implementing build standalone system optimizer randomized optimizer 2 persons query optimization important topic database query processing project build stand query optimizer approaches purpose compare alternatives suggested literature project paper survey query optimization build simple olap line analytical processing system 2 persons olap refined form query processing involves large amount answers queries typically involve aggregates answers presented graphically build ole db database components 2 persons ole db protocol microsoft developed top ole multiple databases connect interoperate project involve protocol build ole db compliant database components built nt visual lot visual ta familiar environment plan project


students bob boyer william bevier shang ching chou wichita state university christian arthur flatau goldschlag warren hunt kim nick mcphee university minnesota natarajan shankar sri subramanian william young yu feedback information contact benjamin shults


thoughts imagine toaster imagine thought toaster day find glance isn big deal size things pretty slowly setting cute important differences machine worry job people don expect strictly functional object animals purposes looked handled unhappy isolated badly dark places things animals nasty don feel tape filter avoid problems things running smoothly feel animals sorts complications made worse fact thought toaster pretty good making toast made surround people toast find lot harder deliver shame find thought pretty good toaster back home


img abstracts img img img img software reliable networks img kenneth birman robbert van renesse img scientific american 1996 failure single program single computer crash network machines causing havoc stock exchanges telephone systems air traffic control operations software designers explain make networks robust horus flexible group communication system robbert van renesse kenneth birman silvano maffeis communications acm april 1996 emergence process group environments distributed computing represents promising step robustness mission critical distributed applications process groups natural correspondence data services replicated availability part coherent cache support highly security domains group mechanisms fit emerging generation intelligent network collaborative work applications masking overhead protocol layering robbert van renesse proceedings 1996 acm sigcomm conference stanford september 1996 layering protocols advocated dealing complexity computer communication criticized performance overhead paper present insights design protocols insights mask overhead layering similar client caching file system techniques achieve order magnitude improvement end end message latency horus communication framework atm network send deliver messages varying levels semantics 85 microseconds protocol stack layers written ml high level functional language world wide failures werner vogels proceedings acm sigops european workshop connamoran ireland september 1996 issue unites approaches distributed computing components system failed unavailable designing building systems function global scale failure management considered fundamental building block paper describes development system independent failure management systems applications incorporate accurate detection failed processes nodes networks making compromises design framework protocol composition horus robbert van renesse kenneth birman roy friedman mark hayden david karr august 1995 horus system supports communication architecture treats protocols instances abstract data type approach encourages developers partition complex protocols simple implemented protocol layer protocol layers stacked top variety ways run time describe classes protocols supported present horus object model designed technology interface layers makes work present layer implements group membership protocol show set required properties stack constructed stack protocols fault tolerant totally ordered communication group processes work contributes standard framework protocol development experimentation high performance implementation virtual synchrony model introduces methodology increasing robustness protocol development process trading consistency availability distributed systems roy friedman ken birman tr96 1579 april 8 1996 paper shows important classes actions left commuting strongly commuting executed concurrent partitions system serializable services result inherent limitation ability systems provide services consistent manner network partitions deciding partitionable networks roy friedman keidar dalia malki ken birman danny dolev tr95 1554 november 27 1995 motivated chandra toueg work study decision protocols model closely approximates real distributed systems results show weakest failure detector consensus algorithm adapted network omission failures occur periods processes suspect faulty protocols majority subset participants reach decisions behalf system characterize series stages necessarily arise execution jointly findings establish direct relationship extended version phase commit protocol makes progress traditional phase commit block consensus protocol chandra toueg explore linkage results applicable agreement protocols systems sort leader election dynamic group membership strong weak virtual synchrony horus roy friedman robbert van renesse august 24 1995 formal definition em strong virtual synchrony capturing semantics virtual synchrony implemented horus presented definition nice property message delivered view shown order implement strong virtual synchrony application program block messages view alternative definition called em weak virtual synchrony implemented blocking messages presented definition guarantees messages delivered view slightly weaker notion view message implementation weak virtual synchrony block messages view developed shown system weak virtual synchrony strong virtual synchrony needed capture additional ordering requirements definition em ordered virtual synchrony presented finally discussed extend definitions order cope fact process member group packing messages tool boosting performance total ordering protocols roy friedman robbert van renesse july 07 1995 paper compares throughput latency protocols provide total ordering protocols measured message packing technique buffers application messages short period time sending messages packed main conclusion comparison message packing influences performance total ordering protocols high load optimization checked paper terms throughput latency improved performance attributed fact packing messages reduces header overhead messages contention network load receiving cpus virtual synchrony develop efficient fault tolerant distributed shared memories roy friedman march 31 1995 paper shows define consistency conditions distributed shared memories virtually synchronous environments definitions develop fault tolerant implementations distributed shared memories normal execution operations performed efficiently operations place configuration change delayed consistency conditions sequential consistency causal memory redefined virtually synchronous environments shown provide efficient fault tolerant implementations definitions protocol composition horus robbert van renesse kenneth birman march 29 1995 horus communication architecture treats protocol abstract data type protocol layers stacked top variety ways run time paper starts describing classes protocols supported describe horus object model designed technology interface layers makes work present layer implements group membership protocol stack protocols fault tolerant totally ordered communication group processes conclude presenting remaining challenges project horus flexible group communications system robbert van renesse kenneth birman bradford glade katie guo mark hayden takako hickey dalia malki alex vaysburd werner vogels march 23 1995 horus system offers flexible group communication support distributed applications extensively layered highly reconfigurable allowing applications pay services groups communication coexist single system approach encourages experimentation communication properties incremental extension system enables support variety application oriented interfaces achieving critical reliability unreliable components unreliable glue mark hayden kenneth birman march 14 1995 aggressive quality assurance procedures yield probabilistic confidence reliability complex systems distributed systems large numbers components enormously complex engineering artifacts inherently unreliable efforts researchers developers cellular distributed systems architecture offers hope drastically improving reliability current technologies settings reliability critical approach combines style distributed computing cells loosely coupled probabilistic inter cell computing model based probabilistic broadcast primitive give implementation primitive called demonstrate implement methodology approach compatible popular distributed computing reliability technologies offering considerable isolation spread failures cells preserving privacy network mobile computers david cooper kenneth birman march 03 1995 wireless networks create potential access information mobile platforms pose problem privacy order retrieve messages users periodically poll network information user give network potentially track user movements user hide user location protocols sending retrieving messages carefully designed developed replicated memory service users read memory revealing memory locations reading unlike previous protocols protocol efficient computation bandwidth paper show protocol conjunction existing privacy preserving protocols user mobile computer maintain privacy active attacks incorporating system resource information flow control takako hickey robbert van renesse february 27 1995 upcall based distributed systems widespread recent years upcall based systems provide obvious advantages experiences systems exposed unanticipated problems inefficiency incorporating system resources information flow control essential solving problems variants window based flow control suitable distributed systems investigated message packing improves network bandwidth usage efficiency message throughput presented finally back pressure mechanism controls admission messages system blocking applications high load presented combination window mechanism back pressure mechanism end end management system resources manages network resources manages operating system resources combination maintains good throughput high load design performance horus lightweight group communications system robbert van renesse takako hickey kenneth birman december 1994 horus project seeks develop communication system addressing requirements wide variety distributed applications horus implements group communications model providing unreliable reliable fifo causal total group multicasts extensively layered highly reconfigurable allowing applications pay services architecture enables groups communication coexist single system approach permits experimentation communication properties incremental extension system enables support variety application oriented interfaces initial experiments show good performance support complex multi media applications horus system werner vogels robbert van renesse december 1994 distributed multi media application involves protocols dissemination video audio data distributed application protocols guarantee consistency fault tolerance security shared data objects horus system offers framework complex distributed systems involve number protocols variety protocols rent aspects distributed application including protocols specific multi media applications integrated approach superior combining toolkits illustrate detailed existing video demand application security architecture fault tolerant systems michael reiter kenneth birman robbert van renesse june 1993 process groups common abstraction fault tolerant computing distributed systems present security architecture extends process group security abstraction integral parts architecture services securely fault support cryptographic key distribution techniques detail design implementation services secure process group abstraction support give performance figures common group operations preserving privacy network mobile computers david cooper kenneth birman october 26 1994 wireless networks create potential access information mobile platforms pose problem privacy order retrieve messages users periodically poll network information user give network potentially track user movements user hide user location protocols sending retrieving messages carefully designed paper describe set protocols developed user mobile computer communicate compromising privacy uniform actions asynchronous distributed systems dalia malki kenneth birman aleta ricciardi andre schiper september 08 1994 develop conditions development asynchronous distributed software perform em uniform actions events performed process performed processes paper focuses em dynamic differs classical problems processes continually leave join ongoing computation treat static version problem lacking joins extend results obtained include joins results demonstrate contrast consensus solved asynchronous systems single faulty process dynamic solved failure detection mechanism makes bounded numbers mistakes dynamic arises systems maintain safety primary partition network paper rigorous characterization framework existing distributed programming environments based understanding partitions partition assumption aleta ricciardi andre schiper kenneth birman june 1993 paper discusses partitions asynchronous message passing systems systems slow processes slow links lead virtual partitions indistinguishable real raises question partition asynchronous system overcome impossibility detecting crashed processes asynchronous system system model incorporates failure detect possibly process failures based failure give definition partitions real partitions virtual show assumptions process behavior incorrect failure suspicion inevitably partitions system show interpret absence partition assumption virtually synchronous communication based weak failure andre schiper aleta ricciardi april 1993 failure detectors accurately failure fs fundamental service build fault tolerant distributed applications paper shows fs weak semantics delivers failure recovery information specific order suffices implement virtually synchronous communication asynchronous system subject process crash failures network partitions paradigm asynchronous systems greatly simplifies building fault tolerant applications mask failures replicating processes suggest component architecture implement virtually synchronous communication 1 lowest level fs component top 2a component defines views 2b component reliably multicasts messages view issues covered paper lead understanding membership service semantics proposed recent literature process membership asynchronous environments aleta ricciardi kenneth birman february 1993 development reliable distributed software simplified ability assume fail stop failure model discuss emulation model asynchronous distributed environment solution propose called strong supported highly efficient protocol implemented part distributed systems software project cornell university focus precise definition problem protocol correctness proofs analysis costs keywords asynchronous computation fault detection process membership fault tolerance process group comments werner vogels


hardware verification presentation slides 1 4 slides 5 8 slides 9 12 slides 13 16 slides 16 20 slides 21 24 slides 25 28 slides 29 32 slides 33 36 slides 37 39 conference reports instructed prof emerson report img report img report img report img hardware verification links hardware verification university denmark bunch hardware software codesign papers uc berkeley hardware verification papers stanford university computer system verification provided brigham young university prepared long reading list graduate students hardware verification homepage nasa langley shaobing ma ph student cs ut austin phone 512 482 9343 email shma cs utexas


information parallel programming page random collection links www information related parallel programming mpi message passing interface standard parallel linear algebra package plapack high performances virtual machines project university illinois


previous cse341 cse341 message pretty duplicates intend class session case found read studying languages symbolic languages interactive languages study evaluation document steve hanks thu mar 21 12 15 57 pst 1996


1030 current projects school research generals tron process specific file protection unix operating system work release process effective configuration management interprocess object communication reachable memory graphs persistence containers data structures library status occasional updates modified 4 6 96 virgil bourassa virgil cs washington


conducted research area computational complexity subfield theoretical computer science computational complexity study quantitative laws computation final goals 1 clarifying makes problems hard 2 classifying problems computational hardness 3 deepening trade offs resources classification problems based model turing machines boolean circuits ram mode computation deterministic nondeterministic probabilistic bounds time space depth current research interests design implementation parallel data mining algorithms biomolecular computing computation based counting sets low information content recent publications img back mitsunori ogihara home page img back computer science faculty page changed ogihara


real time computing real time computing resource real time computing resource


job bulletin meta list line job search resources services ut job center internet online career center


fiction page random comments things read generally fiction fiction thrown point references references media games video sources movies television shows written spirit rec arts sf written didn sound basically page covers books read found interesting reason organized order find ve read categories sea stories science fiction authors updated 8 30 95 douglas stuart department computer sciences university texas austin dastuart cs utexas


cs514 homework 3 collaboration collaboration students permitted assignment collaboration single solution submitted grading solution list names collaborators collaborations considered violations academic integrity submission procedure solutions submitted email cs514 cs cornell solution formatted ascii plain text postscript due date receive email 8 00 wed april 3 1996 late assignments accepted problem description read rfc 821 simple mail transfer protocol rfc 822 standard format arpa internet text messages rfcs retrieved rs internic net anonymous ftp selection rfcs machines directory vol doc internet 1 find domain literal rfc 822 sending mail message include copy message received homework solution click additional hints part assignment 2 excluding connection termination minimum number network round trips send small mail message 3 tcp full duplex protocol smtp tcp half duplex fashion client sends command stops waits reply doesn client send multiple commands single write mail data quit commands assuming body isn large 4 organization collection mail transfer agents dns mx records preference values implement load balancing scheme incoming electronic mail assignment requires ftp connect machines cs department firewall options interface ftp client automatically starts connection anonymous user mode type user names mail addresses requests peer machine passive mode data allowing data flow back established tcp connection avoiding problems firewall remote ftp server support passive mode response dir request resort option ftp connect firewall machine fw cs cornell program asks user respond anonymous remote machine replacing remote machine machine reach firewall proxy server setup control connection manage future incoming data connections password asked type password type mail address information found tips firewall manual page


cs302 exam quiz keys sections 16 17 exams exam 1 exam 2 final exam quizzes quiz 1 quiz 2 quiz 3 quiz 4 quiz 5 exams topics taught order fall 95 exam 1 fall 95 exam 2 fall 95 final link active test returned chris weaver computer sciences department university wisconsin madison change 9 3 96 chris weaver


links atp pages ut atp page automated deduction worldwide oxford formal methods page deduction page stanford links stanford igpl bulletin association automated reasoning journal automated reasoning conference automated deduction journal artificial intelligence research unc mechanized inference page iit ai personal home pages dennis theory page cmu ai repository david mcallester inspiring work field works semantic valued logics karlsruhe tps automated theorem proving program higher order logic imps theorem proving system knowledge feedback information contact benjamin shults


introduction html written kurt modified steven fought document introduction html hypertext markup language vast majority documents web written html html intended structural markup language traditional word processor desktop publishing program parts document structural publishing system parts document document element shown user case html browser decides render html elements original developers html wanted browsers developed wide variety systems simple avoid including elements made assumptions web user computer ability display pictures visually oriented tags html simply added browsers developers popular important understand html designed structure document visual appearance document show 12 point times double spaced 2 inch margins sides kinds decisions made person reading document tags html files plain text tags mixed formatting tags h1 operating systems h1 tags pairs called containers surround pieces text tags made tag tag h1 called start tag text inside operating systems called content tag h1 called end tag h1 tag signifies content text displayed header 1 means level 1 largest viewed browser netscape lynx line operating systems tags work tags don end tags tag beginning paragraph doesn end paragraph discuss tag document tag names case sensitive h1 h1 equivalent tags optional attributes modify interpretation tag img tag tells browser display image src attribute image align alignment compared surrounding text attributes tag img src os gif align top structure html file html files follow general format html head title title document title head body body main text document body html tag html contents file fact html format good idea file html html strictly required documents interpreted correctly browsers change future html file split parts header marked head head body marked body body text file enclosed tags header specifies information document general title title title title displayed top screen document title introduction html note automatically display large line beginning h1 body actual text document note html character line spacing unimportant written html head title title document title head body body main text document body html result note huge number documents web written strict html head section completely missing mosaic popular ncsa documentation stress proper construction people learn html emphasis html correctly creating documents looked good mosaic bad html result documents good mosaic bad browsers holds true netscape support encourage wide variety features html spec paragraphs spaces problems beginners html spaces tabs newlines collectively white space equivalent type test test test shown browser test adding blank line document start paragraph make paragraph tag beginning paragraph paragraph paragraph weird short lines instance lines forever fact long extending 80 characters decidedly finite scope blank lines middle html rendered paragraph paragraph weird short lines instance lines forever fact long extending 80 characters decidedly finite scope blank lines middle related br hr tags br produces line break extra vertical space puts hr inserts horizontal rule line extending page section headings common html tags section headings h1 tag earlier fact range tags h1 top level headings h6 bottom tags browser type size indentation color heading level 1 h1 heading level 2 h2 heading level 3 h3 heading level 4 h4 heading level 5 heading level 6 h6 tags denote section numbers chapter 3 section 4 section levels section level tag document type styles html number type styles em adding emphasis strong stronger emphasis browsers display text italics bold characters underlined capital letters asterisks general em strong give good results browsers produces italics produces bold text typewriter style produced tt tag entities entities names start end represent characters written ascii characters markup angle bracket characters tags avoid ambiguities codes lt gt produce similarly character produced amp semicolon end code codes include produces double quote character code ve browser confused character characters iso latin 1 set expressed cern table codes produce umlaut code structure html comment produced contents comment displayed browser versions mosaic broken interpret tags comments comment tags unfortunate text comment comment lists lists construct html types lists ordered unordered descriptive ordered lists produce list numbered items make ordered list ol ordered list li list item tags ol li slices bread peanut butter jelly li spread jelly side slice bread li spread peanut butter side slice li put sandwich eat ol result 1 slices bread peanut butter jelly 2 spread jelly side slice bread 3 spread peanut butter side slice 4 put sandwich eat items automatically numbered order unordered lists similar aren numbered ol ol ul ul bread slices jelly peanut butter descriptive lists giving lists items descriptions dictionary tag descriptive lists predictably dl item term defined dd definition tag make usage clear dl term defined dd definition term za se dd open pie made typically thinly rolled bread spread mixture cheese ground meat baked dl term defined definition term za se open pie made typically thinly rolled bread spread mixture cheese ground meat baked kinds lists limited short items fact long multiple paragraphs long items list text time idea sentence paragraph started surprising eh paragraph blank space separating previous text indented correctly item previous item pictures adding pictures html document difficult picture gif format filename ends gif file format make gif file utility xv pbm programs include image img tag usage tags img tag src attribute tag image inside quotes src insert url image picture felix img src felix gif picture felix default text lined bottom picture align middle align top attributes change instance felix center things img src felix gif align middle felix center things felix img src felix gif align top top world felix top world important attribute add img tags alt browser capable displaying graphics show text put inside quotes lynx text browser page incomprehensible pictures good idea alternative img src felix gif alt felix felix links full explanation create links documents scope document give quick introduction links referred tag img tag href attribute specifies url link points click href link html file link html click file link html text inside tags marked link create link url put url href part anchor link original html source home page href http www cs wisc home page attribute attribute specifies text anchor links jump directly anchor target surround heading chapter 3 book anchor chapter document provide link chapter 3 writing href jump chapter 3 felix book url http www cs wisc book html document jump chapter 3 book href http www cs wisc book html chapter 3 felix book tags number tags quick survey pre text rendered font unlike html white space significant tags honored style tables information tabs work listing similar pre smaller size meant program listings supposedly embedded tags indented text meant long quotes material address address formatting browsers give results br code multiple lines tags dfn definition cite citation code html codes keys keyboard return sample codes var variable names sources information good idea html create html documents links complete sources information read documents


cs536 started cs department policy student computer accounts csl frequently asked questions faqs unix orientation slides printing printers print mosaic pages sample xdefaults settings configuring mosaic class mail alias cs536 1list


skyblue multi local propagation constraint solver user interface construction author michael sannella proceedings 1994 acm symposium user interface software technology pages 137 146 abstract user interface toolkits constraint solvers maintain geometric relationships graphic objects connect graphics application data structures efficient flexible technique maintaining constraints multi local propagation constraints represented sets method procedures satisfy set constraints local propagation solver executes method constraint skyblue incremental constraint solver local propagation maintain set constraints individual constraints added removed constraints satisfied skyblue leaves weaker constraints unsatisfied order satisfy stronger constraints maintaining constraint hierarchy skyblue general successor deltablue algorithm satisfies cycles methods calling external cycle solvers supports multi output methods features make skyblue constructing user interfaces cycles constraints occur frequently user interface applications multi output methods represent constraints paper discusses applications skyblue presents times user interface benchmarks describes skyblue algorithm detail click postscript file return constraints home page


1222 things img favorite record label img favorite annapolis area band clown img favorite comic img favorite comic img mossy bits department creative arts journal img favorite frozen food otter pops img favorite comic poison elves img label worth checking brad cs washington


program 4 hailstone series due date final assignment due thursday october 24 accepted friday october 25 5pm assignment tricky started introduction january 1984 issue scientific american article describing interesting sequence numbers hailstone series series formed 1 pick positive integer 2 odd triple number add 3 divide number numbers bob eventually reach repeating ground state 4 2 1 4 2 1 proven number 1 problem statement write program generate hailstone series number 1 150 chosen user program answer questions number entered user 1 long series 2 largest number series 3 average series information question stop counting number 1 reached 8 entered starting place answer question 1 4 including initial input fourth number sequence 8 4 2 1 1 2 entered answer 2 sequence simply 2 1 question 2 simply asks track maximum sequence question 3 8 start number average 8 4 2 1 4 15 4 3 75 note integer program design hints main program work prompt user enter number 0 quit 1 150 user enters number range program error prompt user correct range user enters valid number program display hailstone series length series maximum attained series elements series prompt user number process user enters 0 indicating quit part program nested loops outer loop repeatedly user initial values loop control generation hailstone series devise terminate outer loop user input 0 quit long user enters numbers valid range 1 150 program print series length series maximum attained series elements series find define function computes series length series elements series arrays store elements hailstone series program functions solve problem receive credit functions find helpful write function takes number input returns hailstone series array length series hint function prototype function skeleton good opportunity write small functions simple tasks computing maximum hailstone series array computing final program 3 4 functions finally included bare skeleton program started job sample run program included include iostream const int true 1 const int false 0 const int max len 200 function prototypes functions write void int number int series int length int int prototype written function int const int int length double const int int length void main function determines number int int 2 1 return false return true skeleton definitions additional functions written test cases required turn screen output generated program run user hailstone series numbers 1 150 include cases user incorrectly type number range handing assignment 1 turn electronic copy source code cpp executable program exe testing program test cases receive electronic copy source code executable lose numerous points case program compile run correctly turn credit program fails test cases receive low score 2 printed copy source code 3 printed copy program run items 2 3 stapled sample run enter number 1 150 0 quit 151 error enter number 1 150 0 quit 34 error enter number 1 150 0 quit 149 series 149 448 224 112 56 28 14 7 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1 length series 24 maximum attained series 448 54 enter number 1 150 0 quit 25 series 25 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1 length series 24 maximum attained series 88 27 enter number 1 150 0 quit 12 series 12 6 3 10 5 16 8 4 2 1 length series 10 maximum attained series 16 6 7 enter number 1 150 0 quit 540 error enter number 1 150 0 quit 8 series 8 4 2 1 length series 4 maximum attained series 8 3 75 enter number 1 150 0 quit 0 grading note program program 3 worth 25 grade correct output correctly turned output 3 correctly handles test cases 5 user interface aesthetic display program output 1 implementation correct loops arrays 6 correct functions parameter passing return calling 6 smart functions avoiding redundancy code 2 documentation program description 1 meaningful variable names section comments 1


2054 pictures current roommates wait psychologists hold web pages learn amateur learn roommates visiting web pages hey description make easier carson gif ted carson love maya ted cool guy apartment working ai dr elkan dr taylor gif adam taylor yep taylor approve hanging zia bike balcony zia eventually find taylor working visual computing lab apartment parties parties isn make kind work record lab gif picture find find rolls film doesn kang su spy agencies move page work high performance computation lab front back icon forthcoming updated february 20 1996 cs ucsd


attendance policy learn program run difficulties combination reading text attending lectures learn minimize difficulties attending class regularly save time long run hear explanations engage discussion things happen study essentially attending class attractive reasons quizzes class count 10 grade worst dropped test questions made primarily lectures mind questions readings tests nutshell responsible covered class understand things occasionally miss class check classmate occurs modified sat aug 31 1996 chad lane


visualization instruction project descriptions mic 1 simulator movies xtango auralization xtango project demos mic 1 simulator movies xtango auralization xtango publications


subject 415 homework due thursday april 25 1996 introduced predicate logic class gave examples expressing english sentences predicate illustrate quantifiers show existential quantifiers removed functions defined clause form talked transformations produce clause form applied formed formula predicate logic point read chapter 5 rich knight paying attention discussion proof procedures 113 logic representation 9 sentences pages 134 136 related comments development proof note sections resolution conversion clause form unification algorithm cover topics class homework problems rich knight chapter 5 page 166 problems 1 3 4 8 notes problem 1 make substitutions predicate logic forms facts prove hate marcus caesar true false unifying problem 4 sentence eats isn killed food ambiguous sense person eats killed food problem 8 assume constant variables


routing processing nodes hosts switches communication links datagram routing packet routing independently unordered unreliable virtual circuit routing set path connection messages path ordered reliable source routing entire route determined source message carries route routing table hop information node destination hop routing algorithms network graph edge weight shortest path tree 2 2 1 1 3 2 tree destination simple protocol sink distance sink 0 parent sink sink send 0 neighbors receive neighbor skip od node distance infinity receive neighbor weight distance distance weight parent send distance neighbors od problems number messages


1145 computer networking courses university wisconsin madison lawrence landweber 1 1991 computer sciences department university wisconsin madison 1210 dayton st madison wi 53706 lhl cs wisc 608 263 7442 table contents 1 introduction 2 computer networks 2 1 overview 2 2 pre requisite 2 3 textbook readings 2 4 curriculum 2 5 project 3 advanced computer networks 4 future back web page


3042 snowy homepage snowy belong species owls called snowy photograph finally arrived night owl owls night owls thought live shilpa desk good friends give good company lonely shilpa banging keyboard home send mail send mail dont email address school shilpa promised lazy head make homepage remembered today avid net surfer list interesting links snowy cool links owl stories story owl disclaimer mine snowy battle owls story moral ah love snowy mole owl owl information meet kin lots pictures favorite snowy typical owls owl barred owl great gray owl invasion owl fun stuff owls bird ascii art birds general avenue homepage bird world finally appeal brothers sisters owls put species list kill colorful stuffed animals meat pure pleasure remember stuffed snowy note stuffed owl real real alive lives live harmony send mail snowy back shilpa homepage


project index web page presents description ssgrg project comprehensive list papers relevant project project index p2 predator adage genvoca rosetta dissertations prairie design patterns miscellaneous interested specific topics subjects perform keyword search ssgrg publication page related web pages img utcs general img ssgrg title page img ssgrg publication page p2 predator series prototypes p1 p2 genvoca generator container data structures memory simulators software generators ssr 97 composition validation subjectivity ieee tse 1997 subjectivity genvoca generators 1995 p2 lightweight dbms generator utcs tr 95 26 p2 extensible lightweight dbms utcs tr 95 04 validating component compositions 1995 reengineering complex application acm sigsoft 1994 leaps algorithms utcs tr 94 28 introductory p2 system manual postscript file utcs tr 94 26 advanced p2 system manual postscript file utcs tr 94 27 scalable software libraries acm sigsoft 1993 scalable approach software libraries wisr 1993 software components data structure icse 1993 single schema database management systems utcs tr 92 47 implementing domain model data structures 1992 p2 software distribution tar file p2 manuals distribution tar file extension supports genvoca programming concepts programming language generators ph thesis 1996 language large scale reusable software wisr 1993 language software system generators tr 93 16 rosetta project build extensible customized compilers domain relational data languages rosetta generator data language compilers ssr 97 generation extensible data languages ph thesis 1994 prairie effort build customized rule based query optimizers components synthesizing rule sets utcs tr 96 05 prairie rule specification framework data engineering 1995 making database optimizers extensible ph thesis 1995 design patterns structural gamma patterns recognized end products large scale program transformations work design patterns explores potential automating structural patterns software maintenance program transformations evolving software oopsla 95 automated software evolution design patterns 95 adage arpa sponsored dssa project build genvoca generator avionics software creating reference architectures ssr 95 adage avionics reference architecture cia 95 domain modeling symposium 1995 genvoca composition validation subjectivity ieee tse 1997 rosetta generator data language compilers ssr 97 generators transformation systems compilers working paper subjectivity genvoca generators 1995 issues domain modeling oopsla 95 validating component compositions 1995 genvoca model ieee software september 1994 products domain models dm workshop 94 design implementation acm october 1992 dissertations programming language generators singhal 1996 making database optimizers extensible das 1995 generation extensible data languages villarreal 1994 generator data structures sirkin 1994 miscellaneous component technologies space applications micro modified december 24 1996 don batory batory cs utexas


approx affine ps affine ps agee ps agee ps aobivar ps aobivar ps aoinfty ps aoinfty ps aoradial ps aoradial ps aowoquasi ps aowoquasi ps approxloc ps approxloc ps bbform ps bbform ps bdr4 ps bdr4 ps bmr ps bmr ps box spline mfiles boxeval ps boxeval ps bsplbasic ps bsplbasic ps cdr ps cdr ps cg ps cg ps compleast ps compleast ps contrapp ps contrapp ps deboorphd ps deboorphd ps extremising ps extremising ps format tex frame1 ps frame1 ps frame2 ps frame2 ps hardy ps hardy ps hermite ps hermite ps journal tex ker ps ker ps ker2 ps ker2 ps l2shift ps l2shift ps leastsol ps leastsol ps lift ps lift ps loclinfl ps loclinfl ps lowbound ps lowbound ps message mm multdvdf ps multdvdf ps multiint ps multiint ps multiw ps multiw ps multpp ps multpp ps na gif ps notaknot ps perturb ps perturb ps polideal ps polideal ps polintconte ps polintconte ps polintelim ps polintelim ps polinterr ps polinterr ps proceed tex pscattered ps pscattered ps quasi ps quasi ps quasiaprx ps quasiaprx ps quasiint ps quasiint ps read refmac tex sauerxu ps sauerxu ps scattered ps scattered ps sct1 ps sct1 ps ps ps smoothwav ps smoothwav ps sphere ps sphere ps stabindep ps stabindep ps stabindep texasviii ps stabindep texasviii ps stablemask ps stablemask ps students survey76 ps survey76 ps symmetries ps symmetries ps temp tight ps tight ps tr20 ps tr20 ps tr21 ps tr21 ps upbound ps upbound ps verbatim tex viva vi ps viva vi ps wav2 ps wav2 ps wavelet ps wavelet ps wh ps wh ps zerocount ps zerocount ps


cs 540 dyer reading assignments 11 1 chapter 18 1 18 4 20 8 rn 10 23 chapter 11 rn 10 14 chapters 9 9 7 10 1 10 6 rn 10 4 chapters 6 1 6 4 7 1 7 3 8 1 8 3 rn 9 25 chapters 4 4 3 5 5 5 rn 9 18 chapter 3 1 3 8 rn 9 11 chapters 5 1 5 4 6 1 6 3 6 7 6 9 8 1 8 4 9 4 chapters 1 2 skim russell norvig rn chapters 1 3 14 4 1 4 4 4 6 graham


marc friedman home page web page cse 573 beef stew watercolors applets camping checklists spanish english collaborative dictionary poetry research favorite quotes links keith golden keith wordbot bike trip artificial intelligence uw cody kwok dan weld ucpop planner research tool changed life works nietzsche english netscape bookmarks file page reference visitor feb 4 96 marc friedman friedman cs washington


utexas mac archive university texas macintosh freeware shareware archive archive ftp counterpart maintained chris johnson office telecommunication services ots note pages follow make lot small graphic elements network connection slow simply performance turn auto load images option www client indices index author index date index product img recent month img anti virus software information img appletalk network software img applications img communications serial modem communications img compression translation file compression decompression translation img development software development related items img games img graphics image viewing manipulation software img information general information documents img internet software services bringing world mac vice versa img sound sound playing manipulation software img system folder additions items add system folder img extensions img control panels img desk accessories calculators note pads calendars img system software apple lets distribute img utility software additional information mailing list notified updates archive email file formats discussion file formats found submitting software submit software archives made macintosh chris johnson


2443 recent publications view synthesis seitz dyer view morphing proc siggraph 96 1996 pp 21 30 seitz dyer image based scene representation view morphing proc 13th international conference pattern recognition 1996 extended tech report version seitz dyer physically valid view synthesis image interpolation proc workshop representation visual scenes 1995 pp 18 25 cyclic motion analysis seitz dyer view invariant analysis cyclic motion international journal computer vision 1997 seitz dyer detecting irregularities cyclic motion proc workshop motion rigid articulated objects 1994 pp 178 185 seitz dyer affine invariant detection periodic motion proc computer vision pattern recognition conf 1994 pp 970 975 extended tech report version scene reconstruction seitz dyer complete scene structure point correspondences proc international conference computer vision 1995 pp 330 337 changed aug 13 1996


research areas chung kuan cheng partitioning placement routing interconnect optimization switching network design prof chung kuan cheng research interests lie areas vlsi cad partitioning placement routing interconnect optimization switching network design applied rapid prototyping systems fpgas partitioning placement plan build hierarchical partitioning package system accept general formats vhdl options call partitioning packages perform specific tasks package groups components clusters goal reducing number inter cluster nets nets critical path clustering physical layout routability performance power dissipation optimized phases clocks examined clustering ensure correct timing plan build performance driven tool building block layout placement addition maximum path delay layout area aspect ratio accurately estimate minimize routing congestion resulting floorplan high likelihood modifications addition capable handling flexible blocks wide variety pin constraints routing interconnect optimization deep submicron process technologies traditional gate delay dominated delay pattern replaced dominated interconnect wire delay route optimize interconnection wires chip optimize performance critical issue recently moment matching emerged promising tool interconnect optimization moment matching circuit simulation potential integrated routing algorithms care constraints automatically investigating ways incorporate moment matching general circuit simulation routing algorithms integration smooth painless switching network design board level emulation systems fpgas switching network plays important role job interconnect chips board wire contention probability minimized goal research devise architecture suitable rapid prototyping systems current generation systems stringent pin count limitations fpgas result pins severe problems large designs


1162 favorite internet service web site mailing list called author named anu garg time bits pieces history character gleaned work answering suggest give surprise subscribe find unsubscribe don instructions verbatim message subscribe unsubscribe send message org subject line subscribe real unsubscribe archives faq words www site http www org img


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


ieee cs tc rts home page www home page ieee computer society technical committee real time systems ieee cs tc rts rtss 96 proceedings line tc rts archives apropos archive contents archived newsletters recent cfp announcements contributions ieee cs tc rts members real time research groups universities boston university usa cornell university usa kansas state university usa texas university usa university adelaide australia university arizona tuscon usa university california berkeley usa carnegie mellon university pittsburgh usa florida state university florida usa university florida florida usa university houston texas usa university illinois urbana champaign usa university maryland cs usa university maryland ee usa university massachusetts amherst usa massachusetts institute technology cambridge usa university michigan ann arbor usa jersey institute technology usa mexico tech mexico usa university north carolina chapel hill usa university pennsylvania usa university pittsburgh usa university rhode island usa scuola superiore anna pisa italy seoul national university korea university texas austin usa uppsala university sweden university virginia usa university washington usa university york england real time research groups institutes centers criccs center real time intelligent complex computer systems usa iit nrc institute information technology nrc canada sei software engineering institute usa special interest groups real time systems research real time database interest group real time sql consortium swedish national real time association amast information server archives ieee cs tc rts symposia 1997 real time technology applications symposium montreal canada 1996 real time system symposium washington 1996 real time technology applications symposium boston ma 1995 real time system symposium pisa italy 1995 real time applications technology symposium chicago illinois 1994 real time system symposium san juan puerto rico archives real time conferences workshops 9th euromicro workshop real time systems 97 3rd workshop real time computing systems applications seoul korea 97 2nd international workshop real time databases vermont acm 50 strategic research real time computing 97 workshop active real time database systems 1997 sigplan workshop languages compilers tools rt systems dart 96 databases active real time 8th euromicro workshop real time systems italy 1st international workshop real time databases newport beach ca 4th workshop parallel distributed real time systems hawaii 95 workshop active real time database systems 1995 rt acm sigplan workshop 2nd workshop real time computing systems applications tokyo japan amast 96 algebraic methodology software technology munich germany amast workshop real time systems bordeaux france 1994 rt acm sigplan workshop orlando fl 1994 workshop real time programming lake germany real time courses tutorials summaries real time syllabus compliant 1991 ieee acm cs curriculum real time seminar boston university 96 tutorial atm support distributed real time applications 96 tutorial real time object oriented modeling 96 real time databases workshop report acm 50th anniversary report real time computing research real time journals books real time systems journal kluwer academic publishers real time books kluwer academic publishers real time magazines real time engineering magazine real time magazine embedded systems programming magazine real time computing magazine real time magazine real time research tools commercial products allegro real time operating system executive controller area network chimera real time operating system carnegie mellon university chorus operating system harmony real time system iit nrc integrated systems rtos industrial tron rtos specification embedded systems maruti rtos lynx real time systems toolset power hawk power unix harris computer systems precise software technologies perts prototyping environment real time systems software systems real time linux operating systems real time ieee posix operating systems tools real time mach operating system carnegie mellon university rtems executives military systems real time executive network distributed rt applications silicon graphics irix react react pro real time support sos rt real time operating system spring system sun microsystems tools communicating systems real time support unix windows nt verilog toolset research wind river systems tools commercial products encore real time computers data acquisition process control systems project technology tools mellor oo methodology interesting pointers ieee institute electronic engineers ieee cs ieee computer society acm association computing machinery siam society industrial applied mathematics cra computing research association nsf national science foundation networked computer science technical reports library unified cs technical reports real time newsgroup copyright 1992 1996 rights reserved maintainer azer bestavros cs bu created june 13 1994 updated july 8 1996


project 1 products date assigned february 14 1994 date due february 28 1994 introduction project involves writing small assembly language program multiplying matrices program input send output basepak runtime window specs overview compute matrix product ab technically ab mod 2^16 matrices 16 bit unsigned integers minimum matrix size maximum matrix size 16x16 input parameters matrix 16 bit unsigned integers matrix product matrix 16 bit unsigned integers matrix product unsigned 8 bit integer number rows unsigned 8 bit integer number columns number rows unsigned 8 bit integer number columns satisfy 1 16 output parameters matrix 16 bit unsigned integers ab mod 2^16 arithmetic arithmetic integers mod 2^16 unsigned 16 bit integer multiplication addition low order word multiplication results user interface user interface program minimal assembly language program program prompt user parameters successively user enter values elements matrix values matrix values entered program output matrices output result matrix numerical input output base 10 matrices output standard order row elements matrix correspond row numbers screen 2 2 matrix elements a11 1 a12 2 3 a22 4 output 1 2 3 4 matrices input prompting user elements time order output text prompt include matrix indices element prompted matrix entered exchange underlined text program output underlined text user input 1 1 1 1 2 2 2 1 3 2 2 4 sample run run program 2 3 4 1 1 0 1 2 1 1 3 2 2 1 3 2 2 4 2 3 5 1 1 10 1 2 11 1 3 12 1 4 13 2 1 14 2 2 15 2 3 16 2 4 17 3 1 18 3 2 3 3 20 3 4 21 0 1 2 3 4 5 10 11 12 13 14 15 16 17 18 20 21 result 50 56 59 176 200 212 corresponds documentation usual documentation guidelines explain registers symbolic constants state input output parameters subroutines apply program 3 subroutines inputting matrices printing matrices multiplying matrices subroutine begin header function synopsis description function calls exceptional conditions hll description put high level language pascal pseudo code description routine register usage map registers input conditions format registers stack entry routine output conditions format registers stack routine returns stack frame stack frame saved registers a6 a6 0 a6 return address 4 a6 param 1 8 a6 param 2 12 a6 subroutine code immediately follow subroutine header comment line block comments blank spaces separate logical sections subroutine code routine swaps registers d0 d1 d1 d0 swap prolog save registers set stack frame link a6 0 set frame pointer locals d2 sp save registers ll compare d0 d1 jump epilog leave cmp d1 d0 blt d1 d0 swap contents d0 d1 d2 scratch register move d0 d2 tmp d0 move d1 d0 d0 d1 move d2 d0 d0 tmp epilog restore registers clean stack frame return sp d2 restore registers a6 rts give high level description function header detailed description block comments blow blow individual line comments don repeat code addition project document aspects program method laying matrices memory indexing conventions misc program check values supplied user fall allowable range ll adapt 32 bit signed decimal routines basepak library 16 bit unsigned routines project simply taking low order word return long acceptable inputting 16 bit unsigned integers wouldn great idea real program long work 16 bit unsigned integers long remember clear high word d0 submitting hand consulting office hardcopy program hardcopy sample run program electronic copy program diskette back cs314 home page


research interests computational geometry traffic management integrated networks algorithms atm network design approximation algorithms geometry resources web computational geometry software geometry action stony brook algorithm repository minnesota geometry center leda library efficient data structures algorithms back subhash suri home page


academic side cyber home muralidhar krishnaprasad home office 1301 spring street apt 201 department computer science madison wi 53715 university wisconsin madison ph 608 256 4818 1210 west dayton madison wi 53706 ph 608 262 9275 email cs wisc graduate work computer sciences graduating december year interests databases networks love challenging job learn ambition dream part project proud aim attain satisfaction taking part design development project mankind official document resume resume ascii postscript versions past undergrad degree computer science engineering ceg college engineering guindy located madras india 200 years present interesting courses madison follow link detailed listing structure courses database courses cs 564 design implementation databases cs 764 topics database management systems cs 799 independent study raghu ramakrishnan network courses cs 640 networks cs 740 advanced networks architecture cs 752 advanced architecture operating systems cs 736 advanced operating systems performance cs 737 performance evaluation modelling projects couple follow links detailed information devise project independent study sequence adt implementation implementation sequence abstract data type paradise geographic information system atm ftp implementation designing developing reliable atm network udp writing ftp server predicting future history part architecture involved designing simulation studies load predicting caches implementation trees heap files part 564 involved assignments developing trees heap files rest page construction signing muralidhar send mail cs wisc modified 03 23 1996


personal background info full tang lap poon rupert hong kong pretty big family brother sisters parents enrolled university texas austin fall 1991 graduated 95 ph program hobbies include playing chess piano swimming reading late sat morning good habit hong kong hong kong small city million people crowd matter street culture people bilingual speaking native tongue cantonese english communicate plans graduated 1995 bachelor degree computer science ph program computer science means school years early talk plan thing finish ph degree


himanshu nautiyal page


hotlinks uab cis web services web page html format designed posting hypertext usenet news information services web server department computer information sciences university alabama birmingham services provided conjunction current research performed members sifter group uab ongoing research area internet information filtering presentation management collection pages evolving documents resources located uab cis selected web gopher servers os 2 page links os 2 software packages developed members uab cis general availability os 2 web gopher server showcase page links describes os 2 based web gopher servers located internet url usenet news web article archive collection pages archive usenet news articles web www urls converted active hypertext links alabama blue cross blue shield medical information server web gopher service access free medical information resources located internet information resources related research contact dr warren jones click home button browse web home page home 80 1994 9 10 cis uab


processing system 314 1 processor overview 2 system interface 3 instruction set 1 instruction word format 2 operand modes 3 arithmetic logic instructions 1 nand 2 3 add 4 asl 5 6 lsl 7 4 data transfer instructions 1 copy 2 load 3 store 4 lea 5 program control instructions 1 cmp 2 3 4 halt 5 4 instruction execution 1 traps interrupts 5 ps314 simulator 1 program back cs 314 home page


www alert redirection response server handled client location http www utexas students connection close moved permanently document moved


fun transformation system demo papers publications equational logic transformation system yu min liang cs masters engineering project cs meng december 1992 department computer science cornell university ithaca york attribute grammar based transformation systems van den berg master thesis utrecht university netherlands inf scr 90 16 june 1990 rapid development program transformation system attribute grammars dynamic transformations van den berg proceedings international workshop attribute grammars applications lecture notes computer science 461 page 101 115 september 1990 paris france


index ~mbirk cs302 examples modified size description dir parent directory 31 oct 96 08 20 txt ci cla cpp 01 oct 96 15 08 5k txt ci str cpp 01 oct 96 15 08 6k