researchers programming languages compilers home pages researchers working programming language theory design implementation related areas disclaimer list exhaustive added list existing entry modified deleted img back language research page related pages sel hpc list home pages functional language researchers sel hpc list home pages compiler researchers oscar list home pages web formal methods researchers logical frameworks semantics based program analysis manipulation researchers home pages martin abadi dec src security distributed systems specification verification methods principles programming languages samson abramsky university edinburgh semantics programming languages concurrency game semantics program analysis gul agha university illinois urbana champaign logic object oriented programming formal semantics actors alex aiken berkeley program analysis type theory optimization constraint theories functional programming instruction scheduling hassan ait kaci simon fraser university constraint based programming object orientation logical functional programming design compilation techniques maria technical university valencia spain logic programming semantics extensions applications integration functional logic programming languages abstract interpretation program manipulation thorsten chalmers type theory categorical logic program verification stanford compilers parallel machines suif jennifer anderson stanford compilers scalable parallel machines suif peter holst andersen diku university copenhagen partial evaluation mix andrew appel princeton standard ml jersey compilation optimization garbage collection functional programming languages zena ariola university oregon principles programming languages formal semantics arvind mit aspects parallel computing declarative programming languages dynamic dataflow architectures implicitly parallel programming language id compilation languages id parallel machines mike ashley university kansas program analysis program transformations language design implementation mikhail auguston mexico state university programming languages design implementation design compiler writing language software engineering testing debugging automation assertion languages lennart chalmers functional programming implementation henry baker independent researcher consultant garbage collection gc storage management programming languages lisp ada apl ml functional programming compilers linear types reversible computation parallel languages quantum computation carlos university concurrent object oriented programming inheritance concurrency control code extensions transactions distributed mobile computing gerald baumgartner purdue functional object oriented languages type systems object types modules franc oregon graduate institute program transformation rewriting functional programming automatic demonstration formal methods software development carnegie mellon functional languages parallel computing architectures compilers networking operating systems lars carnegie mellon type theory modules standard ml compilation ml ml kit partial evaluation sml mix sandip biswas university pennsylvania compilers type theory module systems separate compilation configuration management program slicing michael blair mit dynamically adaptive profile guided specialization partial evaluation program compilation type theory subtyping guy carnegie mellon parallel languages compilers matthias blume princeton implementation functional languages sml scheme efficient data representation separate compilation compilation management cross module optimizations language design alan borning university washington constraint based languages systems lee university college london functional programming object oriented programming visual programming language implementations preston briggs rice jean pierre university tokyo object oriented programming concurrency parallelism meta programming reflection artificial intelligence artificial life computer music kim bruce williams college semantics design programming languages type theory object oriented languages models higher order lambda calculus including subtypes bounded polymorphism barrett bryant university alabama birmingham compiler design formal semantics object oriented technology tim oregon state programming languages leda implementation techniques oop peter university waterloo polymorphism persistence concurrency concurrent monitoring visualization debugging margaret burnett oregon state university visual programming languages design theory implementation ftp papers rod edinburgh computer aided proof relation type theory development correct programs respect specification applications category theory computer science philippe inria rocquencourt generator optimizing code generators compilation techniques cosy optimizing compiler platform software engineering automatic term rewriting system generation term dag normalization problem deterministic finite state automata linear unification pattern constraints dynamic programming reentrant programming pattern matching luca cardelli dec src theory programming languages polymorphism subtyping objects recursion modularization typechecking distribution modula 3 obliq steve carr michigan technological university compilers instruction level parallel architectures nicholas yale systems issues development deployment software tools parallelism giuseppe laboratoire informatique de ecole superieure type theory object oriented programming manuel chakravarty technical university berlin design implementation functional logic programming languages emphasis integration paradigms parallel implementations craig chambers university washington design implementation advanced object oriented languages cecil thomas christopher illinois institute technology parallel programming languages compilers experimental programming models message driven computing icon mark chu carroll university delaware programming languages environments general purpose parallel programming compiler analysis high level optimization wayne university colorado visual programming languages environments chris university college london language design programming environments techniques functional programming high performance computing william clinger northeastern higher order functional languages design specification optimizations correctness generational garbage collection chris colby carnegie mellon program analysis abstract interpretation aliasing synchronization communication behavior concurrent languages concurrent ml jean francois cnrs laboratory prism static analyses dataflow analyses automatic parallelization scheduling data parallel functional programming charles consel university irisa static program analysis compilation compiler generation programming environment prototyping program transformation robert constable cornell systems computer assisted problem solving programming mathematics nuprl models program refinement polya programming language gordon university waterloo parsing text processing attribute grammars data types concurrency patrick ens paris static program analysis abstract interpretation program development verification semantics dirk leuven semantics directed compiler construction integrated environments programming language ada software engineering roger crew microsoft research semantics program analysis verification transformations ron cytron washington university st louis program optimization program transformation intermediate representations dam swedish institute computer science higher order modal temporal logics compositional verification techniques process specification languages applications computer based systems cooperative work laurent universite de hop calculus integration functional object oriented languages olivier danvy aarhus university programming languages partial evaluation continuations rowan davies carnegie mellon type systems ml refinement types partial evaluation computation staging program analysis jeffrey dean university washington practical program analysis partial evaluation interprocedural optimization object oriented languages cecil project mourad laval university quebec programming languages integration paradigms semantics formal methods andre mit quasistatic computing specialization feedback adaptation arie van cwi amsterdam language prototyping algebraic specifications language specific tools program understanding software reengineering stephan universitaet des university semantics programming languages semantics directed generation compilers abstract machines meta programming www programming languages dinesh cwi object oriented programming algebraic specifications theorem proving visual languages partial evaluation sdf static program analysis amer diwan university massachusetts garbage collection inlining memory system performance optimization memory hierarchies partial evaluation program analysis compilers object oriented languages simon dobson rutherford laboratory programming abstractions parallel distributed systems compilation program transformation semantics scott carnegie mellon partial evaluation abstraction performance bruce microsoft research design implementation programming languages dominic university waterloo type systems type inference object types dynamic types operational semantics higher order unification explicit substitutions partial continuations application frameworks dirk katholieke universiteit leuven belgium program specialization techniques susan eggers university washington dynamic compilation code scheduling parallel optimizations locality michael ernst rice university static analysis slicing debugging including optimized code serialization parallel programs game theory intellectual property david mit columbia compiler operating system architecture leonidas oregon graduate institute functional programming database programming languages query optimization program transformation verification matthias felleisen rice principles programming languages mary fernandez research improving software development design high level special purpose programming languages development tools efficient implementation jersey machine code toolkit jeanne ferrante university california san diego intermediate representations optimizing parallelizing compilers optimization parallel memory hierarchy machines andrzej edinburgh continuations cps category theory glasgow lazy functional languages specifically haskell implementation graphical user interfaces flanagan rice analysis implementation high level parallel programming languages ian foster argonne national laboratory parallel languages compilers runtime systems applications christopher fraser bell laboratories retargetable code generation optimization including lcc retargetable compiler ansi timothy freeman carnegie mellon refinement types ml dan friedman indiana university principles programming languages lund hp labs object oriented languages language support coordination distribution concurrency persistence fault tolerance david gelernter yale linda parallel programming software artificial intelligence adaptive parallelism programming environments parallelism realtime data fusion expert databases shai carnegie mellon semantics intensional aspects computation domain theory concurrency functional programming reasoning programs giorgio pisa university database programming languages type theory object oriented languages object oriented database programming language fibonacci carnegie mellon compilers optimizing parallelizing sequential languages parallel algorithms languages architectures andy gill glasgow equational reasoning perform trivial proofs purely functional finite maps parsing combinators christopher corporation methodologies evaluate compiler optimization run time performance joseph oxford software engineering formal methods object oriented relational functional programming combinations concurrent computer architecture based rewriting algebraic specification theorem proving hardware verification philosophy computation benjamin goldberg york university functional programming memory management program optimization andrew gordon cambridge operational semantics concurrency verification john queensland university technology code generation optimization implementation programming languages strongly typed imperative languages nicholas graham york university functional programming languages languages developing user interfaces multi media groupware visual programming environments john carnegie mellon language models complexity type theory parallel algorithms dave grove university washington design implementation optimization advanced object oriented languages cecil carl gunter university pennsylvania domain theory semantics polymorphism computational aspects linear logic structure representation partial information rajiv gupta university pittsburgh parallelizing optimizing compilers parallel architectures distributed real time fault tolerant computing software testing debugging sandeep gupta colorado state university parallelizing compilers parallel program synthesis parallel computing mary hall stanford interprocedural optimization parallelizing compilers suif thomas chalmers type systems subtypes graphical user interfaces functional languages kevin hammond glasgow design implementation pure functional languages haskell john penn state operational semantics type theory compiler verification mathematical logic program transformation abstract machines david hanson princeton lcc retargetable compiler ansi programming languages compilers programming environments michael rwth aachen type systems implementation logic programming languages integration functional logic programming languages alf system abstract interpretation logic functional logic constraint logic programming languages james royal melbourne institute technology foundations logic programming linear logic proof theory deductive databases computational logic robert harper carnegie mellon logical frameworks machine assisted proofs ml modules lambda calculus type theory category theory semantics logics programs functional programming applications functional languages systems programming john diku university copenhagen operational semantics correctness program transformations continuations logics type theory logical frameworks partial evaluation computational static analysis programs chris haynes indiana type systems control abstraction symbolic computation scheme fritz henglein diku university copenhagen type inference systems program analysis algorithmic computational complexity global program optimization jonathan hill oxford bulk synchronous parallel model data parallel strict functional programming implementation hpf library fortran 90 michael hind suny paltz visiting ibm research compiler optimizations programming languages hoare oxford programming methods languages proof techniques programs distributed computing category theory computing science mos switching circuit design richard holt university toronto object oriented programming languages teaching programming urs ho lzle university california santa barbara object oriented programming languages compilers object oriented languages run time compilation james hook oregon graduate institute application formal methods software development theory practice specification programming languages type theory jim technologies language design implementation specification languages tools larch standard template library susan horwitz university wisconsin madison language based programming environments program slicing differencing merging static analysis programs interprocedural dataflow analysis antony hosking purdue university programming language design implementation compilation interpretation optimization run time systems garbage collection object oriented database systems database persistent programming languages systems empirical performance evaluation prototype systems brian howard kansas state programming language design theory functional languages semantics type theory logic computation natural language processing paul hudak yale functional programming haskell parallel programming haskell modular interpreters mutable abstract datatypes graham university nottingham functional programming relational programming programming programming calculi recursion operators categorical methods graham utrecht university netherlands functional relational programming category theory computer science algebraic approaches programming iyer north carolina state university abstract interpretation concurrency formal methods daniel jackson carnegie mellon tractable representations analyses designs code specifications design methods static analysis model checking quinn tyler jackson lambda systems pattern matching language language translation oo oo modeling suresh jagannathan nec research institute advanced language compiler technology scheme programming language incorporation formal methods continuation models type inference abstract interpretation foundation technology parallel distributed computing symbolic irregular applications sics swedish institute computer science foundations design implementation technology languages offer combination concurrency distribution constraints mutable state johan chalmers program calculation programming methodology type systems programming languages programming functional programming trevor jim university pennsylvania semantics compilers type inference cliff jones manchester university compositional formal methods parallel environments support systems formal methods mark jones university nottingham programming language design implementation type theory module systems program transformation analysis functional programming simon peyton jones glasgow design implementation application lazy functional languages practical terms means spend time implementation haskell glasgow haskell compiler ramifications jo diku university copenhagen semantic based program manipulation program analyses program specialization partial evaluation flow binding time analysis representation analysis martin inria rocquencourt france attribute grammars esp 2 system program analysis compiler construction generation bill dec src modula 3 programming languages environments compilers runtime systems jasper cwi compilation term rewriting systems algebraic equational functional languages lazy rewriting algebraic specifications university paderborn germany methods tools language implementation compilation parallel machines dinesh sun microsystems programming languages object oriented languages multi language systems interface definition languages type theory richard kelsey nec research institute compiling scheme scheme 48 continuation passing style andrew kennedy university cambridge type systems type inference dimension types extension programming languages support physical dimension functional programming david keppel university washington abstractions architectures binding times caches compilers dynamic compilation emulation operating systems performance analysis runtime code generation runtime systems modifying code instruction set simulation threads tracing specific optimization maurice van university twente type systems functional programming database specification object orientation semantics languages gregor kiczales xerox parc object oriented programming reflection protocols open compilers efficient compilation high level programs david king glasgow expressing graph algorithms haskell algorithm design correctness imperative functional programming edgar knapp purdue formal methods concurrent program development tool support program design retargetable implementation concurrent programs todd knoblock microsoft research 4d graphics interactivity program run time code generation partial evaluation high level programming languages program analysis optimization type theory kulkarni university toronto compiler optimizations program transformations yi korea advanced institute science technology compile time program analysis programming environments program analysis tools safe programming monica lam stanford compiler optimizations computer architectures parallel computing suif leslie lamport dec src temporal logic actions writing proofs james larus university wisconsin madison programming languages compilers languages compilers parallel machines design programming shared memory parallel computers compiling symbolic languages program profiling tracing program executable editing la loyola university chicago programming languages compilers functional object oriented programming type systems type inference software engineering john oregon graduate institute functional programming functional algorithms semantics lazy evaluation incorporating destructive updates haskell partial program analysis programming specification language design semantics formal methods program specification verification programming methodology object oriented programming functional programming distributed computer systems peter lee carnegie mellon semantics based compiler generation program analysis optimization ml compiler support advanced systems software rustan leino dec src programming program design technologies programming languages systems specification verification program semantics object orientation modularity mark leone indiana university run time code generation partial evaluation compiling functional programs program analysis optimization type theory xavier leroy inria rocquencourt type systems module systems operational semantics implementation ml caml light compiler michael katholieke universiteit leuven partial evaluation partial deduction meta programming ground representation integrity checking uc berkeley compilers higher order languages analysis memory access patterns closure representations avoiding garbage collection sean levy allen eric gardner subrahmanian carnegie mellon dim group engineering design research center cmu object oriented languages environments embeddable languages toolkits support evolutionary prototyping user interfaces collaboration sheng liang yale design implementation modern programming languages modular semantics compiler generation portable common back ends leonid university pennsylvania functional database query languages semantics programming languages partial information karl lieberherr northeastern university adaptive software adaptive architecture description languages jim lipton wesleyan university logic programming type theory intuitionistic semantics programming relations categorical logic bjo rn lisper kth dept theory efficient implementation declarative languages data parallel functional programming program transformations annie liu indiana university program analyses transformations efficiency improvement optimizing compilers language based interactive systems algorithm design program development methods luc inria rocquencourt lazy ml compilation pattern matching parallel implementation strategies term rewriting systems dave mason waterloo compilation functional programming languages standard ml systems programming purposes literate programming aspects text formatting florian hamburg university germany persistent programming environments extensible syntax higher order type checking static dynamic code optimization object store interfaces bernd hamburg university language implementation portable multi threaded runtime systems code generation distributed persistent languages code mobility thread mobility autonomous network agents bidirectional language interfacing cross language exception handling david mcallester mit ai laboratory automated reasoning type inference erik utrecht university functional programming semantics directed compiler generation constructive algorithmics university slovenia design implementation programming languages formal language definition compiler generators attribute grammars dale miller university pennsylvania computational logic proof theory design theory logic functional programming languages unification typed lambda calculi lambda prolog robin milner cambridge mathematical models computation models calculi concurrent computation present logics machines semantics high level programming constructs john mitchell stanford programming language analysis design including module systems object oriented programming type systems reasoning programs applications mathematical logic programming languages automated reasoning algorithms static analysis programs greg morrisett cornell systems hacking high level languages compilers analysis types modeling garbage collection concurrency threads christian diku university copenhagen type inference analysis functional programs program analysis type systems logic lambda calculus extent category theory frank humboldt university berlin compiler optimizations concurrent programming prediction execution time robert muller boston college compilers higher order languages program representation program analysis optimization extensible parsers university erlangen formal semantics concurrency theory translation correctness pi calculus nielsen diku university copenhagen partial evaluation program analysis implementation functional programming languages lazy evaluation oscar university berne semantics object based concurrency software composition languages nikhil dec crl parallel computing languages implementations runtime systems architectures functional languages implementations parallel implementations tobias technische universita mu automatic interactive theorem proving system verification rewriting unification lambda calculus type systems steve novack university california irvine compiling fine grain parallelism lars nyland university north carolina chapel hill high level languages prototyping parallel algorithms development complex parallel algorithms transformation high level code parallel implementations john donnell glasgow functional programming reason parallel systems digital circuits data parallel architectures nondeterminism debugging functional programming environments peter hearn syracuse university semantic logical foundations imperative computation bryan sullivan glasgow parallel computing operating systems compilers partial evaluation functional programming languages sorts odd permutations topics james toole mit storage systems design information retrieval persistent object applications atsushi kyoto university type inference polymorphic record calculus compilation parallelism martin odersky university karlsruhe formal methods definition programming languages design manipulation programs special areas interests program calculi type systems semantics programming languages programming language implementation john la university melbourne australia polymorphic programming languages class modules mehmet university sydney logic programming applied temporal logic dataflow computation temporal databases jens mit theory implementation programming languages didier inria rocquencourt attribute grammars 2 system college distributed programming system architect language aladdin integrated compiler development environment pc grammar debugging tool parser krishna york university optimizing compilers instruction level parallelism instruction scheduling register allocation compiling embedded systems george papadopoulos university cyprus term graph rewriting systems coordination models logic functional object oriented programming larry paulson cambridge isabelle theorem prover formalizing axiomatic set theory formalizing induction principles set theory higher order logic standard ml frank pfenning carnegie mellon type theory application language design logic functional programming languages logic automated theorem proving formal program development programming environments michael icsi berkeley languages compilers parallel distributed machines benjamin pierce indiana university static type systems subtyping bounded quantification type inference lambda calculus intersection types concurrency john university illinois urbana champaign concurrent object oriented programming language design compilation type inference structure analysis concurrent illinois concert project gordon plotkin edinburgh applications logic denotational operational semantics programming languages semantics type systems theories computation general proof theory semantics natural language type free intensional logics situation theory lori university delaware optimizing compilers high performance architectures compiler phase integration language compiler support cluster computing optimizing explicitly parallel programs parallel compilers salil pradhan northeastern university adaptive architecture description languages vaughan pratt stanford semantics parallel distributed computing jan prins university north carolina chapel hill high level programming languages formal techniques program development parallel algorithms parallel computation compilation programs parallel execution william pugh university maryland algorithms data structure design analysis skip lists compilers massively parallel architectures integer programming array data dependence analysis louisiana state university parallelizing compilers high performance computing programming languages computer architecture programming environments norman ramsey university virginia machine code tools retargetability literate programming debugging chris university functional programming functional theory programming languages type theory formal methods jonathan rees mit scheme user defined data types lexically scoped macros modules categories scheme based operating systems jakob diku university copenhagen type systems type inference logical computational aspects type systems type systems program analysis reid glasgow implementation functional languages graphics garbage collection user interfaces debugging formal program development transformation implementation algebraic specifications abstract data types john reif duke parallel algorithms compilers parallel machines formal methods synthesis parallel algorithms mark reinhold nec research institute garbage collection compilation techniques type systems semantics visualization analysis program performance didier remy inria rocquencourt type systems object oriented programming thomas reps university wisconsin madison language based programming environments program slicing differencing merging interprocedural dataflow analysis incremental algorithms jon riecke bell laboratories theory programming languages operational denotational semantics logics programs formal methods type systems inference abstraction higher order languages state control polymorphism rose diku university copenhagen semantics lambda calculus rewrite systems explicit substitution abstract machines sharing graph reduction van cwi centre computer science amsterdam object oriented languages scripting languages prototyping languages designed implemented python implemented abc francois inria rocquencourt extensions ml type system overloading object oriented programming abstract types type operators modularity erik ruf microsoft research design implementation optimization programming languages program analysis support program understanding transformation barbara ryder rutgers compile time program analyses software tools parallel sequential programming environments chair acm sigplan amr sabry university oregon compilers data flow analysis abstract interpretation programming language calculi semantic foundations david sands diku university copenhagen programming language semantics applications abstract interpretation related semantics based analysis techniques don sannella edinburgh lfcs formal development modular software specifications modularization mechanisms machine assisted proof semantics patrick glasgow implementation runtime support pure functional languages including compiler analysis optimisation garbage collection profiling universidade compilers attribute grammars parallel compilation andre university pennsylvania mathematical logic mathematical aspects programming structures bill carnegie mellon semantics based program analysis manipulation information structures david schmidt kansas state denotational semantics intuitionistic type theory michael university aarhus programming languages type systems type inference static program analysis data types language design implementation cotton seed mit motorola cambridge research center computer architecture compilers mpps dataflow implicitly parallel languages program analysis auto parallelization peter royal veterinary agricultural university denmark functional programming languages implementation program analysis transformation partial evaluation zhong shao yale efficient compilation high level languages interaction languages compilers modern architectures programming environments formal methods tim oregon graduate institute compile time reflection type parametric programming program transformation algebraic programming olin shivers mit advanced programming languages scheme ml systems personal user interfaces duncan sinclair university strathclyde functional programming hci research make creation graphical user interfaces functional programs easier singh glasgow functional languages hardware specification synthesis analysis anthony sloane james cook university generation programming language implementations tools environments high level specifications scott smith johns hopkins operational semantics imperative object oriented concurrent programming languages operational equivalence programs logics programs ellen spertus mit dependence graph ir code generation register allocation superscalar superpipelined architectures mcgill university data flow analysis compiler optimization instruction level parallelism multithreaded architecture optimizing explicit parallel programs memory consistency models bjarne steensgaard microsoft research static program analysis program transformation dependence graph ir data flow analyses store splitting partial evaluation patrick brussels free university reflection object oriented programming languages systems user interfaces user interface building application building allen stoughton kansas state programming language semantics full abstraction models applied typed lambda calculus pcf logical relations lambda david international computer science institute compiling distribution compiling locality garbage collection sather dave calvert university york uk compiler verification pvs verification system oregon graduate institute transformational programming systems functional programming object oriented programming software engineering compilers carolyn talcott stanford formal reasoning semantics programming languages open distributed systems reflection isi cnr italy parallel computing architectures concurrent programming languages distributed systems bob tennent edinburgh semantics design programming languages logics george lake shore labs corp illinois institute technology object oriented languages enhanced actors programming model virtual machines parallel distributed programming languages class libraries typing systems stephen thomas university nottingham implementation functional languages design abstract architectures functional languages tim frank tip ibm watson program analysis program transformation restructuring program slicing optimizations object oriented programs mario keio university object oriented computing concurrent programming distributed open systems cooperative problem solving andrew tolmach portland state university functional language implementation tools david kansas state implementation prolog lp languages semantics lp languages semantics database query languages david turner glasgow type systems type based program analysis functional programming pi calculus implementation concurrent calculi chau wen tseng stanford compiler support scalable parallel architectures suif franklyn turbak wellesley college programming language semantics implementation type based compilation visual languages robot languages mark mit optimizing programs specifications university amsterdam formalisms tools language design prototyping syntax definition type systems documentation tools grammar formalisms parsing algebraic specification sdf german vidal technical university valencia spain integration functional logic programming languages abstract interpretation based program transformation philip wadler glasgow linear logic call type classes strictness analysis data abstraction garbage collection william waite university colorado boulder automation compiler construction mitchell wand northeastern semantics compiler correctness type inference david watt university glasgow action semantics language design semantics directed compiler generation rapid prototyping martin chalmers concurrency william weihl mit parallel distributed systems programming languages compilers operating systems computer architecture pierre weis inria design implementation functional programming languages compilation type systems caml language daniel weise microsoft research advanced representations analysis build compilers programming tools seeking holy grail abstraction cost don explicitly hack partial evaluation anymore diku university copenhagen partial evaluation standard ml binding time analysis hand writing program generator generators david whalley florida state university compiler optimizations support tools performance evaluation diagnosing compiler errors predicting execution time paul wilson university texas austin memory management garbage collection allocators persistence texas store extensible languages compilers rscheme memory hierarchies free software russel university college london languages environments developing parallel object oriented systems development information systems including processes techniques tools environments philosophical aspects wing carnegie mellon formal specifications concurrent distributed systems programming languages programming methodology search retrieval information superhighway michael melbourne university logic programming linear logic functional programming michael wolfe portland group compiler optimizations compiling parallel machines david wolfram australian national university semantics declarative languages higher order languages meta theories semantics concurrency object based languages effectiveness implementations andrew wright nec research institute soft typing type systems compilation techniques scheme ml wong university pennsylvania institute systems science singapore interoperable systems multimedia systems programming methodologies query languages programming language semantics gao beijing university aero astro constraint hierarchy object oriented languages linux takashi kyushu institute technology visual programming parallel programming compiler compilers attributed grammars katherine yelick berkeley programming languages runtime support parallel machines optimizing explicitly parallel programs yonezawa university tokyo parallel computation models programming languages object oriented programming natural language processing guo qiang zhang university georgia athens domain theory semantics programming languages applied logic nonmonotonic reasoning benjamin zorn university colorado boulder programming language design implementation specific emphasis language runtime systems ways support efficient program execution ease programming img back language research page additions corrections mark leone mleone cs cmu


exams solutions prelim 1 oct 17 96 prelim 2 nov 19 96


cse 473 project topic descriptions due friday 17 preliminary demonstrations due friday 24 final demonstrations reports due friday 31 rationale justice topics artificial intelligence require single 3 credit quarter project offers opportunity choose topic depth examination don cover covered flexibility work partnership student class apply representation inference techniques studied case put good lisp developed past weeks topics select chapters 5 14 text topic area chapter select specific topic augmented transition networks stone world program natural language understanding chapter 11 choose topic covered class project explore topic greater depth choose topic haven sample programs text starting point implement additional features perform experiments friday 17 turn project topic description includes 1 2 project descriptive 3 book chapter selected 4 sample program plan work 5 features ideas explore 6 work divided working partnership 7 required strongly encouraged bibliographic reference text additional reading chosen topic give sentence summary reference relevant project select machine learning natural language understanding vision neural networks design project work input data world wide web train neural network distinguish types html files pattern recognition experiments images downloaded online galleries home pages jeremy strongly suggest project executed learn ai make project regard give informal demonstrations classmates time time suggestions make program understandable preliminary demonstrations prepared show lisp program friday 24 interesting sample program text demo include feature alternatively giving demo time turn 1 page progress report class final demonstrations reports 31 turn diskette lisp program hardcopy report project guidelines form report tanimoto cs washington


cse 457 introduction computer graphics opengl programs list programs found opengl programming guide addison wesley publishing company examples run running mosaic locally silicon graphics workstation buffer anti aliasing 10 4 run view scene anti aliasing run view anti aliasing perspective 10 2 run view buffer anti aliasing run view calculates field view direction run aim view aim simple 2d alpha blending 7 1 run alpha view alpha alpha blending 3d 7 2 run view anti aliased true color lines 7 3 run anti view anti anti aliased color index lines 7 4 run view anti aliased points color index mode run view anti aliased points mode run view anti aliased polygons reality engines 7 5 run view simple 2d bezier curve 11 1 run view bezier surface 11 3 run view wire frame version 11 2 run view texture maps rectangles 9 1 run checker view checker texture maps repeated run view repeats edge pixels pattern run chess view chess arbitrary clipping planes 3 5 run clip view clip diffuse material run view cone run cone view cone stretched wireframe cube perspective run cube view cube dimensional nurbs curve run curve view curve fog make distant lines run view draw disks run disk view disk buffer make distant objects 10 5 run dof view dof scene dof blur run view double buffering rotating square 1 3 run double view double draw bitmaps 8 1 run view feedback buffer queues gl prints stdout 12 7 run feedback view feedback fog 7 6 run fog view fog fog color index mode 7 7 run view draws text font display lists 8 2 run font view font demonstrates lighting model run light view light display lists draw lines run view types lines 2 1 run lines view lines executes display list draw triangles 4 2 run list view list demonstrates run list2 view list2 lighting color map mode run view assortment materials shown 6 3 run material view material draw texture map color bitmap size 9 2 run view demonstrates modeling transformations 3 2 run model view model light source moves object 6 2 run view nurbs uniform rational splines surface shaped heart run nurbs view nurbs mouse depth buffer select objects 12 6 run view mouse select lines run view mouse select square run view demonstrates directional versus point lights run plane view plane composite modeling transformations drawing models arrow keys move spheres run planet view planet planet scene oriented run view demonstrates polygon 2 2 run view arrow keys move wire frame arm 3 7 run robot view robot color light source run view scene colored light run scene view scene scene blue ambient light run view scene flat shading run view shows selection mode stack detect objects collide viewing volume 12 2 run select view select white rectangle black background 1 2 run simple view simple gouraud shaded triangle 5 1 run smooth view smooth wire frame sphere run sphere view sphere diamond cuts part scene 10 1 run view demonstrates stroke vector font display lists 4 8 run stroke view stroke nurbs surface symmetrical hill 11 5 run surface view surface versus sided lighting run tea view tea ambient values run view materials shown run view texture mapped teapot texture coordinates generated automatically 9 3 run view evaluators generate curved surface texture 11 4 run view broken curves trim part nurbs surface 11 6 run trim view trim font draws fonts run view sean cs washington modified tue sep 20 1994


foidl foidl ilp system learning order decision lists ordered lists clauses ending cut obtain current results learning past tense english common lisp prolog code foidl anonymous ftp readme files details pointers papers foidl found ilp research page standard reference click open book image induction order decision lists results learning past tense english verbs raymond mooney mary elaine califf journal artificial intelligence research 3 1995 pp 1 24 paper presents method inducing logic programs examples learns class concepts called order decision lists defined ordered lists clauses ending cut method called foidl based foil employs intensional background knowledge avoids explicit negative examples problems involve rules specific exceptions learning past tense english verbs task widely studied context symbolic connectionist debate foidl learn concise accurate programs problem significantly fewer examples previous methods connectionist symbolic img estlin cs utexas


cs 418 laboratory 8 modeling scientific visualization introduction scientific visualization term refers process converting data pictures lab demonstrate techniques visualization techniques view simulated landscape complete rivers clouds examples shown result calculating height field displaying landscape blue flat polygon simulating water surface density field displaying cloud volume rendering isosurface extraction polygon rendering set rivers determined plotting gradient height field gradient shown considered plan view landscape slopes image shows landscape 100 stream start locations procedure download program landscape net landscape cfg program 2d field make landscape calculates 3d scalar field densities cloud fields manipulated derive slope surface visualized modules include isosurface module fits polygons points equal field strength 3d field module constructs arrow point vector field streamline module vector field direction flow refine module points field map module data field interpolated positions field programs usr lpp dx samples programs examples modules assignment run program times options control panel modify program add features modify colors rivers mapping magnitude gradient slope coloring high slopes regions streams white simulate rapids lower slopes blue program map module map altitude add map module colors based data component field shown modify surface color green ocean level white mountain peaks pale yellow colormap module modify river generator start rivers regular grid points 5 5 surface construct module make starting grid image 100 stream starts modify program produce trees surface module produce arrows vector field type input module geometry cone place point surface parametric surface input run refine module level input set triangles include module limit trees band elevations shown reduce module lower density trees surface modify program produce animation cloud animation show cloud changing density distribution fixed density functions make ten time steps sequence results 1996 demo assigned functions modified net interactors control functions added usual style program graded function cloud animation separate program lab 8 grading guide filled consultant section evaluate work back main page lab 9 modified 2 26 96 land copyright statement


analog vlsi robotics research project abstracts 42 questions analog computing analog field computing visual design analog computers continuous evolutionary computing indiana university cyclotron controller minimalist robotics retic behavioral model based vertebrate reticulate formation c690 ph dissertation length research projects interested students send mail jonathan mills return computer science research page


david karr lego collection affiliated lego group disclaimer details david karr document home page world wide web resource located http www cs cornell home karr lego index html text version document version expected load faster hot list official lego world wide web site guide lego ftp archive joe construction toy home page michael lego list web ve check list updated 24 1996 contents web site separate page models david karr models jane polly karr models people separate page lego resources web separate pages academic web sites personal web pages citations received web site occasional question created web site explanation web page models david karr show photographs lego designs fairly recent evidence left childhood work nowadays design models adapting style developed years figures built pages complete discussion links images models vehicle collection includes sports car dump truck motorcycle large fashioned aircraft collection includes models airplanes world war fighters space collection includes space cabin unmanned rocket rail road collection includes editions favorite steam locomotive passenger car ship collection includes oil plenty miscellaneous pages including toy cannon machine gun fire 2 4 lego bricks woman pushing design salon style utilizing construction machine scoop models jane polly karr daughters jane polly put number models added important enhancements models put designs enhancements give insight young children play lego overview work jane turned 6 1995 work polly turned 4 1995 models people impossible wonderful lego models people posted world wide web links favorites including animation walking spider complete story house large red dragon 1959 beautifully finished models lego resources web sort web pages ve roughly categorized high level information servers academic web sites separate page usenet news trading opportunities personal web pages separate page miscellaneous good stuff high level information servers servers people official lego world wide web site lego group web officially march 22 1996 page blurbs product line interesting historical information pictures information caring replacing lego bricks discussion trademarks related issues press releases lego ftp archive ftp archive extensive collection files assembled paul includes images models programs drawing lego reviews lego sets archive located austria brian ward web friendly possibly complete view collection hypertext guide archive construction toy home page joseph put substantial resource lego toys page depth features model team lego trains images brochures catalogs era 1963 1973 recent times model month page featured summer building contest 1995 page unique features explanation molecular lego bricks molecules assemble wall yahoo recreation toys legos links yahoo collected lego related links heading large extent duplicate links find michael lego page toy page site maintained eric myers offers sorts internet web resources toy include good collection lego related links internet toy white pages lego page michael list number pages list web list due depth breadth content apologies excellent efforts failed properly acknowledge academic web sites web sites schools sorts fourth grade graduate school ve list separate page happy hunting usenet news usenet news group lego topics rec toys lego hypertext version rec toys lego faq frequently asked questions list maintained tom mail gmd de germany plain text version necessarily date lego ftp archive early 1995 number subscribers rec toys lego participated roll call posting response survey andy watkins archived responses continue archive responses occasional survey archives combined line summary convenient table contents nic page statistics rec toys lego newsgroup interesting view guesses read newsgroup hundreds thousands dollars postings costs net trading opportunities frequent sales auctions lego rec toys lego newsgroup real collectors items break brand sets redistribute pieces opinion good thing light lego current organization sets 1995 todd lehman ran auctions nicknamed literally months auction big home page web worth visiting long stays line kind prices expect pieces internet auctions todd written excellent rec toys lego auction shipping faq helpful information buying selling lego internet jason home page put enterprise rtl bricks web select specific part rtl bricks catalog specific color order bulk marketplace individuals post ads buy sell lego kind desire site original designs promises services future global wholesale toys page offering line purchase lego sets 20 discount normal prices prices high compared shop home normal prices zealand higher united states personal www pages large number people put lego lore web volunteered identify regular home pages ve make complete list pages real gems pages list highly recommend peruse complete list web pages miscellaneous good stuff bayer group turns supply abs plastic lego group page featuring life sized lego super car explaining lego bayer connection line images linked mind boggling close shots parts car software corporation advertising product called bricks dimensional drawing program models built lego compatible bricks elements citations received thumbs ve recently awarded positive guys review web page october 13 26 1995 issue web review updated mon nov 25 10 23 41 est 1996 david karr karr cs cornell


2473 daily schedule spring 96 monday tuesday wednesday thursday friday 9 00 9 30 10 00 10 30 grail mtg 11 00 grail mtg 11 30 12 00 12 30 590 1 00 590 1 30 2 00 2 30 3 00 3 30 519 590 520 590 4 00 519 590 520 590 4 30 research mtg 590 5 00 research mtg 5 30


cse 321 assignment 1 autumn 1996 due friday october 4 1996 read text discrete mathematics applications sections 1 1 1 3 problems edition text practice problems page 11 problem 7 page 12 problem 15 page 13 problem 27 problems 1 page 11 problem 8 2 page 12 problem 16 parts 3 page 12 problem 18 4 page 13 problem 22 5 bonus page 13 problem 28


cs100 prelim 1 general info tuesday february 13 1996 7 30 pm prelim 1 cover recursion teitelbaum section 2 11 page 2 15 coverage tail recursion comma operator higher order functions complexity performance prelim 1 review session held sunday february 11 3 00 pm baker 200 room assignments olin 255 upson b17 kimball b11 olin 155 cs100 spring 1996 pierce cs cornell


1418 people working paradise project principal investigators david dewitt jeff naughton research staff josef burger bolo curt ellmann students guo navin kabra roger biswadeep nag jignesh patel karthik ramasamy kristin tufte jie bing yu alumni nirupama chandrasekaran jun luo wei xiao back paradise home page


lutheran campus ministry university texas austin lutheran campus ministry lcm ministry evangelical lutheran church america lcm open christian community dedicated assisting people academic settings discover fulfill jesus christ located university lutheran center 2100 san antonio telephone number 472 craig sommer serves campus craig avaiable confidential conversations counselor specializes relationship marriage family therapy drop call 472 appointment img sunday worship 11 00 starting january 12 1997 wednesday 6 00 starting january 15 1997 bible study opportunities tuesdays 7pm sundays 10 00 starting january 14 1997 opportunities serve special activities announced previous activities member lutheran campus ministry memorial scholarship lutheran resources contact information craig sommer phone 1 512 472 address 2100 san antonio austin tx 78705 usa world wide web www locator http www utexas students lcm mail lcm www utexas send comments lcm www utexas updated december 22 1996 return ut austin home page


dream aaai presidential address 19 august 1985 woody bledsoe twenty years ago dream day dream dream shared dreamed special kind computer eyes ears arms legs addition brain dream computer friend means making money employer country loved country making money dream worthy helping poor handicapped world marvelous machine dream filled wild excitement machine act human ways wanted read printed characters page handwritten script part small camera fit glasses attached ear names friends acquaintances met street telephone allowed converse friend germany german english computer friend ability recognize faces synthesize voice understand spoken sentences translate languages things ll admit 1960 computer person larger head envision didn microcomputers dream computer person walk play ping pong teach things learn skills mental concepts awoke day dream found didn things remarkable computers decided quit job set spending rest life helping bring dream reality forget dream periods life recently reporter asked scientists ai research answer money wouldn mind rich deeper make machines act fundamental ways people period reminded dream life awhile fairy tale computer prove hard theorems difficult theorems mathematics recognize faces diagnose diseases reason analogy learn ways engage intelligent discourse common sense play good bridge tennis amazing 1958 1960 1962 drives happened buck made ai don mind fact economic interest push forward part needed research buck dollar yen frank pound mark drives make happen march drummer proud part responds music don explain dream require mathematician engineer computer scientist results surprised require good science dream buck rogers hal 2010 starwars turing test objects kind piled ridiculous things divided breathing vacuum faster speed light leaving present knowledge science exciting generous things die pressing science bit won cut part excitement major milestones physical parts proposed computer person important 1960 robot run fall act autonomously moving companion aware real problems mind computer programs act reason act understand learn plan enjoy hate challenge age happened room talent bring rest unfolds years decades fail stop occasionally enjoy smell roses thrill milestone reached began prepare talk wondered worth hearing contemplating brought mind thoughts dream things important calling ai researcher 25 years totally kind dream shaky shaking running thinking laid season language translation died facial recognition pushed back researcher stack automatic provers showed signs growing pains machine stepped forward turing test robot arms duplicating block castles playing squash ai researchers lost faith dropped remained ai fold 25 years fruitful exciting proud left foremost learned small child remains ineffective taught knowledge machines reasoning enabled prehistoric man invent wheel matter brain space age woman knowledge wheels gears engines computers aerodynamics reasoning power discover knowledge king knowledge key reasoning enhanced knowledge reasoning knowledge reasoning essence knowledge business ed feigenbaum working knowledge application machines smart program solve problem regulate chemical process design bridge key pieces knowledge built ai answer ai scientist engineer recognizes knowledge case expert systems plucked program separate knowledge base knowledge give power functionality knowledge base acts powerful computer language programmer carry defines functionality actions changing knowledge base foremost learned knowledge knowledge accumulated mankind thousand years achieve ai dreams accomplished great deal 30 years mention express annoyance ai researchers jumping infinity leap work step step dream obtaining controlled energy cure cancer cure common cold step step process allowed partially duplicate intelligent behavior human beings natural language system restricted form english legitimate step passing turing test case history science helped discovery ai accomplishments partial kind natural language processors handle subset english french systems recognize synthesize limited forms speech character recognition machines read characters expert systems perform variety tasks human theorem provers prove difficult theorems area mathematics handle inferencing needed elementary expert systems including monotonic reasoning programs play expert level chess programs exhibit elementary level learning reasoning analogy list key thing learned learning list crucial technologies needed continue pursuit ai objectives partial results mentioned helped stand ai beginning enumerate classify enabling technologies foremost list representation storage knowledge added requirement design learning ease acquiring storing knowledge performance effectiveness stored knowledge perform tasks solve problems answer questions time build large large knowledge bases knowledge base common sense knowledge expert knowledge structured handle learning performance requirements mentioned effort sort headed doug lenat mcc common sense knowledge fundamental analogy knowledge acquisition problem solving believed large structured knowledge base sharing knowledge numerous systems structured correctly provide robustness functionality number distinct smaller kb true machine intelligence effective machine learning case number good researchers beginning make progress area earlier work machine learning tended ambitious general recent efforts success things learned controlled knowledge structures machine finds values facets human supplied framework real gain reasonable capacity rethinking learning analogy process scratch rethinking apply areas ai research twenty years ago tempted requires things build machine appears human machine learning natural language understanding machine taught feeding knowledge existing books letting bootstrap higher higher levels mental functionality requirements formidable fact afraid characterization misleading lets major present ai machine learning correct principle long run won term press areas ai machine learning important work speech acts pushed delayed machine learn books carry discourse marvin minsky suggestion ability program learn proportional program achieved exploited dramatic frightening causality important research area ai intelligent programs expert systems begin fail move shallow statistical rules reasoning basic principles research programs pushing direction key move basic principles step time basic principles step knowledge actions classified levels causality explain giving holds object hand feet ground releases 1 fall ground 2 fall ground increasing velocity 3 fall height feet governed equation 5 16 measured seconds 4 fall newton law attraction 5 3 accounting air friction 6 fall laws general relativity applications answer release fall child drop rock hurt foot called shallow level deeper levels give information precise higher cost human operating continuously level expert system early expert systems tended operate level causality shallow level fortunate allowed programs exhibit great deal expertise minimum cost successes expert systems great field ai helped build confidence ai researchers worthwhile accomplishments promised financial returns term pay research development operating shallow level bad works problem level adequate deeper causal reasoning needed point machines directed step deeper causality chain causality properly jumping deepest causal level working levels needed recent work qualitative reasoning correct step direction make work properly knowledge structure governed partly common sense needed control process super expert systems coming decade absorb large percentage research development effort years rightfully expert systems endowed large structured knowledge bases ability reason causality levels deeper levels needed limited ability learn automatically experience accumulate knowledge analogy truth maintenance systems enhanced human interfacing facilitate knowledge acquisition experts ease super expert systems evolve thinking part opposed moving sensory parts dreamed intelligent machines future versions enhanced ability learn learning directly machine readable text reason analogy list areas feel dominate ai research decade discussed list automatic reasoning important research areas large structured knowledge bases knowledge representation knowledge storage retrieval expert systems technology large effort machine learning controlled knowledge structures causality depth levels human interfacing natural language processing speech recognition generation automatic reasoning analogical reasoning common sense reasoning default reasoning complete listing mentioned important areas robotics automatic programming planning automatic reasoning area research increasingly important number reasons earlier expert systems required modest inferencing power operated rules levels reach deeper causality reasoning component challenged handle switching levels added complexity deeper levels knowledge plays crucial role emergence logic basis programming languages prolog means storing knowledge logic data bases logic based rules expert systems suddenly load automatic reasoning programs provers great interest machines perform large number logical inferences high performance needed horn clause problems prolog reasoning order logic modal logic higher order logic renewed interest automated theorem proving interesting concepts handling horn clauses order logic expected produce raw range cope load imposed generation applications methods special reasoning knowledge units speeding proofs applications event automatic reasoning research relevant future misunderstood general purpose reasoning machines theorem provers knowledge key requirements reasoning knowledge partly satisfied high speed provers beginning great faith ai community headed generally direction half crop graduate students admitted ph program computer science university texas year selected ai preferred field study preference ai duplicated world talking students young people hold hands future discipline power influence earlier pioneers researchers emerge urge students researchers set vision future courage make major question learn pointed generally direction major gains made personally favor bold approach timid bold experiments made effort mechanical translation mt work early 1960 called failure obvious mt language understanding awareness made clearer earlier experiments helped focus research important area natural language processing exciting led resurgence mt similar story told early speech recognition quality speech recognition language understanding early experiments perceptrons represent cases lot work lack great idea robot project sri case early work widely appreciated principle make good idea give shot waste money early feedback don forever study problem expensive exciting strategy scientific method requires character part researcher analyze experiments theories press person qualify work entrusted research funds recently reading thomas edison team time developed successful light bulb started thought good idea ahead brash build widely usable electric light bulb early ideas wrong lucky brilliance years language translation early expensive failure returned information helped finalize successful solution ai position today kinds bold experiments needed bold conducted men women character wisdom persistence succeed concern flash pan researcher person limited theory trivial application feedback builds program surprise leaves prove extend work fragment pretty brilliant real researcher fragment part larger effort absorb credit recall ai pioneers important characteristic good researcher answer good research successful people find succeed fail native intelligence important ingredient equally important characteristic ability inclination combine theory experiment young people set dream set goal part bringing dream tool education employment facilities pursue today ve content researcher worth salary don easily don insight training work hard provide momentum don give easily don spend time work properly recognized satisfied make personal contribution compare compete rules researcher field conviction field ai worth finest efforts told dream offered advice young researchers offered opinion important areas ai research predictions make surprised acknowledgement doug lenat mary shepherd dawson joe hassan ait kaci elaine rich dick martin dick hill helpful comments title due martin king


2072 img closest thing baby book ve assembled isis basically log development notes days polish ve linked pages forward back arrows bottom page click follow links recent page click month birth month month month fourth month month sixth month seventh month eighth month ninth month 12 9 96 ve massive update isis web site past weeks including pictures months ve broken page smaller pieces longer maintaining latest activities page ll put summaries end month img img img updated december 9 1996 brian kris grant grant cs washington


happy hour adam seligman year masters student run informal happy hour roughly week year gracs social chair president vice suspect isn official cs department gracs event students faculty staff significant insignificant friday evenings 5 7pm subject whim people drink beer drink soda eat chips salsa generally good time list people interested send weekly mail telling meet drop note added list ll happy hour great people department meet scoop ut cs program adam seligman click send email list cheers


students woody bledsoe robert anderson phd 1970 math university houston mike eds robert boyer phd 1971 math computational logic computer science mathematics ut peter bruell phd 1979 cs houston space center stephen charles phd 1969 cs claude ma 1967 math morris enfield ma 1968 cs feng phd 1994 cs bell labs james hall ma 1967 math larry hines phd 1988 cs university texas austin eds dallas phd 1972 math tech math department phd 1973 cs ricoh california research center palo alto john minor phd 1979 cs mark steven phd 1977 cs computer science lab sri james morris phd 1969 cs don simon university pa tyson phd 1981 cs sri john ulrich phd 1968 cs tie cheng wang phd 1986 cs kestrel green palo alto ca charles phd 1969 math hugh williamson ma 1967 math feedback information contact benjamin shults


tufts university alumni mail address list initial list great alphabetical list growing growing current implementation unwieldy point devise database format enter information form automatically added page automatically married women changed suggest enter parenthesis lukas meyer warning exact list replace information problem put middle initial solve page maintained chris lukas contact questions comments suggestions lukas cs wisc year full email address snippet information provide submit reset values start year mail address bit information


updated 09 26 96 socket source code manual socket version 1 10 code developed sekar virginia department engineering university virginia socket code periodically updated master repository ftp ftp virginia pub socket source code socket 1 10 tar gz socket manual postscript 54 pages


cs 302 fall 1996 section 4 algebraic language programming instructor milo martin milo cs wisc program 3 due friday october 4 1996 objective give student experience working writing functions program description due great cash register program wrote restaurant earned reputation skills high demand large hardware distributor nails write program replace cash register program greater challenge restaurant number added complications price customer pays nail decreases quantity ordered increases detail warehouse finite number nails stock program operator place order type nail stock cost ordering number type nail calculated quantity ordered base price nail nails customer orders customer pays nail discount schedule 1000 regular price 1000 10 discount 1000 15 discount 25 discount price 1300 items 10 cents piece 1000 10 300 9 cents 127 00 1300 9 cents note user orders 800 item point orders 500 item discount ordered 1300 nails sells types nails chart item number description base cost nail quantity hand warehouse item item description cost nail number warehouse 315 2 0 nails 0 025 426 3 0 nails 0 030 20000 537 4 0 nails 0 035 25000 648 9 0 nails 0 050 30000 customers order box 100 nails box size similar program prompt user order track item ordered loop user asks bill display final bill program requires prompt user item number quantity ordered design menu bill formats previous assignment dollar amounts formatted 2 decimal places constants variables input checked make valid input valid user prompt user input statements apply programs code provided object assignment give practice functions provided basic framework main function build functions job complete functions fill program perform desired operations code main function modifications code header comments include ltiostream const int true 1 const int false 0 function prototypes int main int choice item number int quantity quantity ordered int num 0 num 0 cumulative number item ordered int num 0 num 0 prompt user input print menu num num num num choice choice quantity quantity process order place order choice quantity num num num num true user continue display bill summarizing items ordered print bill num num num num functions write list functions write assignment procedures require call parameters call reference parameters figure types parameters print menu function print menu current subtotal including tax calculate subtotal function compute subtotal including tax items ordered calculate price function called calculate subtotal arguments quantity ordered item price item computes cost rules program description choice function prompt user item number ensure return legitimate item number user enters invalid choice error message printed user number quantity function prompt user quantity order ensure return legitimate quantity remember user enter number nails desired number divisible 100 valid nails 100 item packages user enters invalid choice error message printed user number place order function attempt place order adjusting num total quantity item requested greater stock hand order filled informative stock message displayed message display item stock quantity order reduced ordering item stock drop 10 000 items descriptive low item message printed item number function user continue ordering items user print bill return true loop executed false true false integer constants included code main print bill function print number item ordered items customer ordered subtotal final total adding 5 tax similar program turn program working print sample runs program output file demonstrate ordering quantities items discount levels calculated orders exceed items stock orders stock low message displayed requests item handled properly large request submit print outs source code sample program runs submit electronic copy source code executable previously created dave burnett milo martin dan yao


groovy artwork section artwork set tarot cards completed piece faces ve closely angle ll find face time guaranteed lastly ve photograph sort manipulation combine negatives great image expect days links full images links full images tarot cards img swords img circles img emperor img empress img hanged man img wheel artwork img faces photography img sun send mail back 13 november 1995


cs516 high performance computer architecture final project kernel endpoint net march 28 2 1996 ankit patel gerry toll apatel cs cornell tc cornell project description kernel endpoint net drawback net doesn existing applications kernel facilities tcp ip easily share underlying network hardware net based user level applications ways problem solved idea implement required services library user level functions net transport mechanism approach construct endpoint inside kernel access network hardware net device driver decided long run provide flexibility library based implementation kernel endpoint place type data transmitted network protocol additionally communicate net hosts careful compatible header formats idea advantage virtual network interface provided net driver treat real network card inside kernel communication kernel endpoint doubt slower user level endpoints idea applications multiplex kernel endpoint existing socket based apps run idea implement ip high level protocols essentially replace low level kernel functions sending data atm ethernet card routines read write kernel endpoint project milestones march 28 project proposal met matt welsh idea project involve platform project pc running linux fast ethernet hardware ideally abstraction provided net code work atm hardware proves true remains scope project time permits natural extension work understanding basic idea project provide ability kernel access net interface written net driver writing code bridge gap ip net device driver understanding diagrams network architectures april 18 checkpoint meeting setup hardware pentium pcs interconnected fast ethernet null modem setup software linux net software loaded machines kernel code compiled net pingpong application tested run properly crc errors received possibly due absence fast ethernet hub expected latency obtained basic setup divided project basic parts concentrate 1 lib kernel level implementation libunet 2 dev pseudo ethernet driver implemented lib major issues decided solved issue 1 create kernel level endpoint driver accept ip datagrams passes net driver handles transmission receipt issue 2 make net endpoints behave kernel endpoint requires made net code force kernel endpoint kernel space issue requires understanding net architecture driver code issue 3 solve problem kernel endpoint receive packets net hand ip receiving end kernel code scanned find place efficient method implemented issue 4 net requires channel created communicating hosts exchange data devise efficient mechanism activating channels needed additionally map channels ip addresses large network maintain channel host overhead activating channel substantial activate transmitted packet solutions issues april 19 code wanna hackers kernel code net code man hack issue 1 kernel generic device structure represent network devices construct device struct trick kernel believing talking real network card large portion functionality provided libunet kernel current form ll rewrite work inside kernel add module order stuff tulip tulip made global inside kernel issue 2 april 22 process kernel mode access user space memory macros fs memcpy put fs memcpy verify area write protection allowed kernel mode checking area safe write kernel endpoint works kernel space functions called creating deleting endpoints channels issue 3 april 23 net polling receiving end net pick packets pass ip april 24 considered polling cpu time wasting signals kernels ipc methods communication processes problem remains april 25 implementing wake wait queue upcall function pass buffer sleep wait queue april 26 turned sleep wake mechanism required simply upcall packet received time waste efficiency increase april 27 stuck problem device structure higher level code layers ip worry network devices problems april 28 hey increase efficiency pick incoming packets directly rx rings ip passing endpoints bypass endpoint data directly ip consulted matt welsh wishes modified code extensions net code portable atm matt plans provide interface user processes multiplex kernel endpoint ip flexible interface net conclusion endpoint extra overhead involved copying buffer issue 4 hey leave cs516 class 3 poster presentation img img img img img img img project status semester project ran difficulties finished majority code written major issues resolved expected overhead future extensions lot instructor thorsten von eicken providing opportunity hardware work project matt welsh maintaining patience explaining explaining net driver internals providing guidance project additional alan cox michael johnson linux kernel mailing list assistance solving linux problems related links information net net home page information linux linux documentation project information related tcp ip maintained ohio state online list internet rfc


ken harker politics semi active member republican party previously served secretary acting president republicans dartmouth fiscal conservatism support civil liberties promotion gay rights validity economic theory support free trade support stronger united nations republican party accepting tolerant diverse political party generally perceived wanted general colin powell ret run republican presidency 1996 united states resources united states constitution white house house representatives senate texas resources state texas city austin tx city tx north american resources canada open government mexico de nacional international resources united nations contact utcs home page html 3 2 updated 10 27 96 information page optimized lynx validated kharker cs utexas world wide web facility www cs utexas provided service faculty students staff guests department computer sciences university texas austin views opinions expressed page sole responsibility author kenneth harker necessarily reflect views opinions department computer sciences university texas austin university texas system board regents


2876 mike school graphics stuff started user interface research migrated graphics advisor david salesin department 1992 bunch cool ideas graphics research photorealistic rendering specifically pen ink illustration graphics group worked projects area automatic generation pen ink illustrations dimensional models texture information worked addressed interactive creation pen ink illustrations dimensional grayscale starting image project ran problem stemming fixed resolution images wanted magnify images maintaining sharp features blurring image compensate magnification wanted features stay crisp requires information stored image couldn captured image created project addressing problems resulting paper accepted siggraph quick preview demonstration note sharp line segment image methods image magnification pixel replication blurring discontinuity rest graphics people good people time group graphics imaging lab grail anthony wrote java graphing program learn bit java impression java kind neat ways real pain lots things hype money succeed wildly applet poke make change display parameters


compiler related information primer class students mentioned desire material pointers url document dealing specifically pointers information pointers test program cse373 cpp sample program assume file named cse373 cpp include iostream void main void cout cse 373 cout autumn cout 1990 6 compiling running program compile program entropy hilbert type command cse373 cpp run program type note receive warning message ignore message reflect minor problem mscc setup user program runs alright cse unix machine program warning message bin ld warning linking objects exception information sections fatal runtime exception handling problems obj encountered exceptions usr local lib libstdc modified 14 october 1996 tanimoto


cse532 software engineering ismap problem sets problem set 1 problem set individually textbook exercises turned hardcopy programming exercises turned electronically turnin program problem set 2 problem set groups problem set 3 problem set 4 problem set 5 problem set 6 admin lectures homework handouts links cse532 home img lumsdaine


jeffrey moore william lee scott dawson jmm cs wwlee cs spdawson cs work longer beta alpha release final presentations slides screen shot game madness implemented online version popular parker brother board game monopoly adapted reflect trends geography cornell community implementation obvious variations traditional version order illustrate concepts inherent distributed systems paradigm information refer project design specification document game played internet requiring java interpreter running solaris windowsnt graphically advanced commercial cdrom version stretch imagination enhancements real time updates fluctuating interest rates inflation excitement game play exposition modified rules outlines enhancements intent illustrate distributed programming concepts entertaining media learn language object oriented design distributed systems areas computer science exploited project utilized object oriented design skills data structures program theory meets practice practical distributed system tie distributed systems game server player correspondence message passing learned concepts broadcast algorithms support fault tolerance methods real time behavior distributed system measure success unlike dean don measure success time players play completing game rules business contributing cornellopoly expanding population java applications internet finally progressing week 2 12 progress report week 2 19 progress report week 2 26 progress report week 3 04 progress report week 3 25 beta release mulva jerry seinfeld girlfriend rhymes part female anatomy courtesy junior mint episode seinfeld visitors march 25th 1996


christie check resume img fix cs washington


cecil language specification rationale version 2 0 craig chambers department computer science engineering university washington box 352350 seattle washington 98195 2350 usa september 12 1996 abstract cecil purely object oriented language intended support rapid construction high quality extensible software cecil combines multi methods simple object model kind dynamic inheritance modules optional static type checking instance variables cecil accessed solely messages allowing instance variables replaced methods vice versa cecil predicate objects mechanism object classified automatically based run time mutable state cecil static type system distinguishes subtyping code inheritance cecil enables graphs single set declarations streamlining common case graphs parallel cecil includes fairly flexible form parameterization including explicitly parameterized objects types methods implicitly parameterized methods related polymorphic functions commonly found functional languages making type declarations optional cecil aims mixing migration exploratory production programming styles cecil supports module mechanism enables independently developed subsystems encapsulated allowing type checked reasoned isolation presence multi methods objects extended externally additional methods instance variables encapsulated separate modules supporting kind role based subject oriented programming style document describes design cecil language december 1995 mixes specification language discussions design issues explanations reasoning led design decisions table contents 1 introduction 1 1 design goals major features 1 2 overview 2 dynamically typed core 2 1 objects inheritance 2 1 1 inheritance 2 1 2 object instantiation 2 1 3 extension declarations 2 1 4 predefined objects 2 1 5 closures 2 2 methods 2 2 1 argument multi methods 2 2 2 method bodies 2 2 3 primitive methods 2 3 fields 2 3 1 read mutable fields 2 3 2 fields methods 2 3 3 copy shared fields 2 3 4 field initialization 2 4 predicate objects 2 4 1 predicate objects inheritance 2 4 2 predicate objects fields 2 5 statements expressions 2 5 1 declaration blocks 2 5 2 variable declarations 2 5 3 variable references 2 5 4 assignment statements 2 5 5 literals 2 5 6 message sends 2 5 7 object constructors 2 5 8 vector constructors 2 5 9 closures 2 5 10 2 6 precedence declarations 2 6 1 previous approaches 2 6 2 precedence associativity declarations cecil 2 7 method lookup 2 7 1 philosophy 2 7 2 semantics 2 7 3 examples 2 7 4 strengths limitations 2 7 5 multiple inheritance fields 2 7 6 cyclic inheritance 2 7 7 method lookup lexical scoping 2 7 8 method invocation 2 8 2 9 files include declarations 2 10 3 static types 3 1 goals 3 2 types signatures 3 3 type signature declarations 3 3 1 type declarations 3 3 2 representation object declarations 3 3 3 type object extension declarations 3 3 4 signature declarations 3 3 5 implementation method declarations 3 3 6 field implementation declarations 3 3 7 type declarations 3 3 8 discussion 3 4 special types type constructors 3 4 1 named types 3 4 2 closure types 3 4 3 upper bound types 3 4 4 greatest lower bound types 3 5 object role annotations 3 6 type checking messages 3 6 1 checking messages signatures 3 6 2 checking signatures method implementations 3 6 3 comparison type systems 3 6 4 type checking inherited methods 3 7 type checking expressions statements declarations 3 8 type checking subtyping declarations 3 9 type checking predicate objects 3 10 mixed statically dynamically typed code 4 parameterization parametric polymorphism 4 1 explicit parameterization 4 1 1 parameterized declarations formal type parameters 4 1 2 instantiating parameterized declarations 4 1 3 parameterized objects types 4 1 4 method lookup 4 1 5 type checking instantiations 4 2 implicit parameterization 4 3 matching type patterns 4 3 1 method formal type patterns 4 3 2 upper bound type patterns 4 3 3 matching algorithm 4 3 4 static dynamic matching 4 3 5 constraints graphs matching 4 3 6 matching bounded formal type parameters 4 4 implicit type parameters extension declarations 4 5 parameterized objects method lookup 4 6 parameterization syntactic 4 7 bounded polymorphism 4 7 1 motivation 4 7 2 bounded polymorphism singly dispatched languages 4 7 3 bounded polymorphism cecil 4 7 4 bounded polymorphism multiple types 5 modules 6 related work 7 conclusion acknowledgments references appendix annotated cecil syntax 1 grammar 2 tokens 3 white space cecil language reference manual 12 sep 96


3146 probabilistic planning adapting classical planning algorithms deal uncertainty world state effects actions buridan planner attempt planner explores issues action state representation problem evaluating partially generated plan interacts generating plan buridan assumes agent additional information world execution time conditional buridan planner extension actions provide information world change world joint work dan weld denise draper recent papers include probabilistic planning information gathering contingent execution appears proceedings probabilistic model action commitment planning information gathering appears proceedings probabilistic planning information gathering contingent execution longer tech report describing material information language symbolic probabilistic approach planning information producing actions conditionals approach planning incomplete information etzioni hanks weld draper lesh williamson hanks cs washington


home page participating publishers albert universitaet institut fuer informatik authors years auburn university authors years boston university authors years california institute technology authors years carnegie mellon university authors years chicago journal theoretical computer science authors years chinese university hong kong authors years cornell university computer science authors years cornell university theory center authors years dimacs authors years dartmouth college authors years duke university authors years erasmus university rotterdam authors years george mason university authors years icase authors years iowa state university authors years johannes kepler university linz austria authors years johns hopkins university authors years artificial intelligence lab authors years laboratory computer science authors years mcgill centre intelligent machines authors years mississippi state university authors years navy center applied research artificial intelligence authors years york university authors years north carolina state university authors years odense university denmark authors years dominion university authors years oregon graduate institute science technology authors years oregon state university authors years pisa university italy authors years princeton university authors years rice university authors years suny buffalo authors years stanford university authors years swiss federal institute technology lausanne authors years swiss federal institute technology zurich authors years technical university berlin authors years technical university hamburg authors years technical university munich authors years texas university authors years turku centre computer science finland authors years universitaet stuttgart germany authors years universite de montreal authors years university bonn authors years university california berkeley authors years university california irvine authors years university california san diego authors years university central florida authors years university chicago authors years university colorado denver center computational mathematics authors years university hamburg germany authors years university illinois urbana champaign authors years university ljubljana jozef stefan institute authors years university germany authors years university maryland college park authors years university massachusetts amherst authors years university north carolina chapel hill authors years university rochester authors years university saskatchewan authors years university tennessee knoxville authors years university texas austin authors years university toronto authors years university utah department computer science authors years university virginia authors years university washington authors years university wisconsin madison authors years university zurich switzerland authors years virginia polytechnic inst state university authors years xerox design research institute authors years ncstrl server operates cornell university send email tech reports cs cornell


recent publications listing recent publications chronological listing multimedia file system overview papers placement fault tolerance support interactive operations admission control clustered servers multimedia operating systems processor scheduling multimedia networks network layer protocols multimedia transport protocols multimedia miscellaneous multimedia file system overview papers 1 sriram rao harrick vin ashis tarafdar comparative evaluation server push client pull architectures multimedia servers proceedings 6th networks operating systems support digital video audio april 1996 view abstract view paper 2 prashant shenoy pawan goyal harrick vin issues multimedia server design acm computing surveys special issue symposium multimedia systems december 1995 view paper 3 jim gemmell harrick vin dilip kandlur venkat rangan multimedia storage servers tutorial survey ieee computer 1995 view abstract view paper 4 harrick vin multimedia systems architecture defining global information infrastructure infrastructure systems services ed stephen vol spie press pages 287 296 november 1994 view abstract view paper placement 5 renu tewari richard king dilip kandlur daniel placement multimedia blocks disks proceedings spie multimedia computing networking san jose january 1996 view paper 6 harrick vin sriram rao pawan goyal optimizing placement multimedia objects disk arrays proceedings ieee international conference multimedia computing systems icmcs 95 washington pages 158 165 1995 view abstract view paper 7 harrick vin prashant shenoy sriram rao analyzing performance asynchronous disk arrays multimedia retrieval proceedings ismm international conference distributed multimedia systems applications honolulu hawaii pages 14 17 august 1994 view abstract view paper fault tolerance 8 prashant shenoy harrick vin failure recovery algorithms multi disk multimedia servers technical report 96 06 department computer sciences univ texas austin 1996 view abstract view paper 9 harrick vin prashant shenoy sriram rao efficient failure recovery multi disk multimedia servers proceedings twenty fault tolerant computing symposium pasadena ca pages 12 21 june 1995 view abstract view paper support interactive operations 10 prashant shenoy harrick vin efficient support scan operations video servers proceedings acm conference multimedia 1995 view abstract view tech report tr95 25 view paper postscript html admission control 11 harrick vin alok goyal pawan goyal algorithms designing large scale multimedia servers computer communications march 1995 view abstract view paper 12 harrick vin pawan goyal alok goyal goyal statistical admission control algorithm multimedia servers proceedings acm multimedia 94 san francisco pages 33 40 october 1994 view abstract view paper 13 harrick vin alok goyal goyal pawan goyal observation based admission control algorithm multimedia servers proceedings ieee international conference multimedia computing systems icmcs 94 boston pages 234 243 1994 view abstract view paper clustered servers 14 renu tewari mukherjee daniel harrick vin real time issues clustered multimedia servers submitted publication april 1995 ibm research report rc view abstract 15 renu tewari daniel mukherjee harrick vin high availability clustered multimedia servers proceedings international conference data engineering orleans feb 1996 view paper 16 renu tewari daniel mukherjee harrick vin design performance tradeoffs clustered multimedia servers proceedings ieee icmcs tokyo june 1996 view paper 17 daniel william mukherjee renu tewari scalable highly web server proceedings compcon march 1996 view paper 18 dan daniel mukherjee sitaram renu tewari buffering caching large scale video servers proceedings compcon 1995 view paper multimedia operating systems 19 pawan goyal xingang guo harrick vin hierarchical cpu scheduler multimedia operating systems proceedings usenix symposium operating system design implementation technical report tr96 12 department computer sciences ut austin view abstract view technical report multimedia networks network layer support multimedia 20 pawan goyal harrick vin cheng start time fair queuing scheduling algorithm integrated services packet switching networks proceedings sigcomm 96 stanford ca august 1996 tr96 02 department computer sciences ut austin view abstract view conference version view technical report version 21 pawan goyal harrick vin generalized guaranteed rate scheduling algorithms framework technical report tr95 30 department computer sciences view abstract 22 pawan goyal harrick vin network algorithms protocol multimedia servers proceedings infocom 1996 view abstract view tech report tr95 19 23 pawan goyal harrick vin chia shen prashant shenoy reliable adaptive network protocol video transport proceedings infocom 1996 view abstract view tech report tr95 18 24 pawan goyal simon lam harrick vin determining end end delay bounds heterogeneous networks proceedings international workshop network operating system support digital audio video durham hampshire pages 287 298 april 1995 view abstract view paper transport protocols multimedia 25 posnak vin lavender designing presentation processing engines adaptive multimedia applications proceedings multimedia computing networking san jose january 1996 view abstract view paper 26 posnak vin techniques resilient transmission jpeg video streams proceedings multimedia computing networking san jose volume 2417 pages 243 252 february 1995 view abstract view paper miscellaneous 27 posnak lavender vin adaptive pipeline object structural pattern adaptive applications 3rd pattern languages programming conference monticello illinois september 1996 view abstract view paper pjs


version 1 0 demos hotjava demo page page links hotjava demos release audio wanted bouncing heads synchronized audio animation image loop image animation tic tac toe interactive game sorting algorithms animated sorting algorithms hangman interactive game img img send comments questions java java sun