topics data structures 1 searching algorithms site 1 2 sorting algorithms site 1 3 queues site 1 4 stacks site 1 5 linked list site 1 6 graphs site 1 7 binary trees definition animation binary site 1 download source balanced opsis site 1 site 2 efficiency download source splay demo source tree search site 1 site 1 site 2 examples examples 2


tcp ip pointers charles original tutorial 87 html tutorial rfc 1180 tcp ip tutorial ipx oriented history timeline starting 57 tcp ip tutorial pc lube tune tcp ip tutorial unix administrators


robokreta robokreta besar img img robokreta img robokreta besar robokreta autonomous intelligent toy cars built chassis motors fast radio controlled rc toy racing cars brains based mit 6 270 controller boards cars metamorphosis ready debut upcoming robofest wyl


university washington department linguistics university washington department linguistics home page university washington located city seattle washington department linguistics department college arts sciences degrees linguistics romance linguistics information department activities contacting department linguistics degrees offered department linguistics people department linguistics courses descriptions department linguistics lab working papers linguistics information questions comments contact phoneme washington maintained mark washington modified 5 2 96


computer aided verification cav 96 floc 96 cav 96 home pages including technical programs registration information


cse 557 introduction computer graphics autumn quarter 1995 personnel professor tony derose office sieg 315 office hours monday 1 30 2 30 wednesday 2 30 3 30 office phone 206 685 email address derose cs washington information click ta jim fix office chateau 109c guggenheim annex office hours wednesday 1 30 2 30 friday 11 30 12 30 sieg 4th floor cubicles office phone 206 616 1848 email address fix cs washington


www site maintained legal information institute cornell law school www server integrates gopher based www based offerings legal information institute cornell law school internet hypertext html publications mounted links relevant legal materials gopher server internet server offers hypertext front end recent supreme court decisions distributed day decision project hermes growing collection historic decisions collection recent opinions york court appeals ny analysis selected decisions hypertext version full code important legal documents holds mail address directory faculty staff law schools host cornell law review full information internet browser published hypertext law materials disk offers information cornell law school cornell law library tour additional site highlights newcomers shortcut heavily sources items special current interest main menus legal topics sources organizations people site additional www sources law items special current interest server include eye courts decisions net heard law related lists decisions international court justice downloading materials disk publications hypertext word processor formats purchase download law students laptops electronic martin 1996 latest addition collection occasional papers digital technology access legal information dispute resolution viewed developing country martin 1996 digital law future legal information technology martin 1995 set forms enabling update searches code provisions expanded listing state statutes net companion topical index searchable index circuit court decisions internet including retrieval citation hypertext version law related discussion listserv archives focus commercial internet law sites staying current supreme court ny court appeals mail institute disk based legal publications 96 97 academic year supreme court 1994 95 term state statutes net impact information technology law federal court statistics service court rules including supreme court rules federal rules evidence lawyers internet internet access work congress main menus legal material organized topic constitutional law copyright legal material organized type source treaty legislation judicial opinions internation federal state finding finding legal organizations people site legal information institute report 95 96 future plans disk publications mail law bulletins policy linking commercial sites working paper describing process porting views html evolving www standard sites visit don find www virtual library law internet law library house representatives altavista index einet information galaxy searchable index einet search law harvest index www home pages lycos catalog www press canadian resource list general information world wide web links servers fields provided w3 consortium ncsa includes beginner guide html finally consult gophers world included point communications top 5 net lycos 250 sport pair cool gave


past visitors collaborators dave plummer developed developed match working information diagrams prove theorems bishop brock worked analogy frank brown worked prover set theory cooper worked analogy don loveland works model elimination procedure lemmas order logic proofs worked precondition prover william pierce worked analogy randolph wang worked precondition prover incomplete list feedback information contact benjamin shults


3101 david dion ddion cs washington work department computer science engineering sieg hall 109a university washington fr 35 seattle wa 98195 usa 206 616 1846 home 8320 lake city ne apt 305 seattle wa 98115 4437 206 616 1846 current life lack thereof days waking hours spent working department computer science engineering university washington long figure current interests lie operating systems spin escape chateau office complex sieg hall remain active active cse racquetball ladder throw challenges anytime love play golf don current life check office past life seattle graduated mathematics university notre dame department computer science engineering gained research experience notre dame avid member notre dame bands remain faithful supporter fighting irish meager chances 1996 national championship enjoyed exciting october 12 1996 meeting huskies university washington irish pretty irish david dion modified monday 28 october 1996


research demos img discern story processing demo running img pole balancing symbiotic adaptive neuro evolution virtual posters img introduction primary visual cortex img unified organizing model primary visual cortex img psc article visual cortex model back utcs neural networks home page martym cs utexas


5230 marc langheinrich resume marc langheinrich 5210 woodlawn ave seattle wa 98103 206 632 6637 education 1991 present universita bielefeld germany graduate student diplom computer science natural sciences faculty technology expected graduation spring 1997 summer 1995 summer 1996 university washington visiting graduate student fulbright program department computer science objective obtain position field computer science information systems specifically career involving utilization intelligent agents modern computer applications experience research assistant department computer science university washington usa summer 1996 development web agent software research project ahoy homepage finder agent architecture finding personal homepages world wide web program size 10 000 lines programming language perl5 oop application programmer webmaster university library university bielefeld germany 1994 1995 programmed library applications student dos windows created maintained library web server including hardware platform selection software evaluation network installation university net supervisor system group project department computer science university bielefeld germany 1993 1995 design implementation knowledge based therapy module part diagnosis system coordinator systems programmer group tutor computer science classes department computer science university bielefeld germany 1992 1993 teaching assistant technical cs theory classes database programmer 1989 1995 programmed medium large database applications paradox foxpro access customers health care provider moving companies personal client assistant rasmussen gmbh maintal germany 1987 1991 responsible jit production delivery vital car parts major german car companies mercedes benz bmw porsche vw daily trading volume averaging 10 000 computer skills proficient areas internet tools world wide web gopher wais http server httpd apache website unix dos windows 3 1 95 nt systems tcp ip network programming programming languages pascal lisp perl5 object oriented java javascript html http operating systems dos 1 nt 95 unix mac os database applications microsoft access foxpro borland paradox paradox windows including programming experience databases word processing microsoft word wordperfect ami pro latex document preparation system language skills native speaker german fluent english communicate french japanese scholarships 1995 fulbright scholar university washington seattle usa 1990 nominated des deutschen scholarship marc langheinrich scores gre toefl references request university washington department computer science email marclang cs washington www http www cs washington homes marclang


mike dahlin technical classics list technical classics articles books computer scientist read read year list complete start elements style strunk white strunk original edition web writing solid code steve maguire microsoft press debugging development process steve maguire microsoft press acm classic paper month href mailto dahlin cs utexas dahlin cs utexas


www alert redirection response server handled client document moved document moved


grail software data software coordinate free library geometric programming version version surface reconstruction unorganized points data repository meshes miscelaneous material anonymous ftp people courses projects publications theses software data images home page comments mtwong cs washington 18 november 1996


page notes dr porter class week updated frequently strongly encouraged check page regularly lecture week august 26 simple algorithms programming lecture week september 2 functions text manipulation lecture week september 9 functions numerical computations lecture week september 16 top design lecture week september 23 software engineering review midterm updated lecture week october 7 transistors circuits chapters 6 8 lecture week october 14 computer architecture chapters 9 lecture week october 21 machine translation compilers chapter 10 lecture week october 28 computational tractability chapter 11 lecture week november 5 parallel computation chapter 12 lecture week november 12 artificial intelligence chapter 13


1802 cs 838 1 java implementation reader fall 1996 1997 instructors james larus mark hill java mark java virtual world microprocessor report 10 4 8 11 17 25 march 1996 java implementation mark java virtual world microprocessor report 10 4 8 11 17 25 march 1996 brian case implementing java virtual machine microprocessor report 10 4 12 17 25 march 1996 brian case java virtual machine stay virtual microprocessor report 10 5 14 15 15 april 1996 sun market java chips part significant bits column microprocessor report 10 2 4 5 12 february 1996 history richard johnson john wick overview mesa processor architecture proc international conference architectural support programming languages operating systems pages 20 29 march 1982 david ungar blau peter foley samples david patterson architecture soar smalltalk risc proc 11th annual symposium computer architecture pages 188 197 june 1984 updated mark hill tue aug 27 14 35 12 cdt 1996


page notes lab discussion session week discussion topic found topic week ta assignment labs discussions found lab discussion schedule give sketch session check page periodically case notes stuff covered mondays wednesdays including solutions assigned discussion sessions discussion session week sep 9 game 1 complete solution game discussion session week sep 16 top design courtesy eugene gorbatov 1 complete solution average program students class discussion session week sep 23 software engineering courtesy isaac sheldon discussion session week oct 9 binary numbers logic binary adder discussion session week oct 16 computer architecture assembly language courtesy shailesh kumar discussion session week oct 23 machine translation courtesy jack sarvela 1 lexical handout distributed class 10 21 2 answers problems posed lexical analysis handout distributed class 10 21 discussion session week oct 30 parsing courtesy jack sarvela discussion session week nov 13 parallel processing discussion session week nov 30 artificial intelligence courtesy neeraj mittal 1 tutorial prolog programming handout distributed class 11 25 send comments criticisms suggestions links additions dwip cs utexas home tas description discussion sessions news articles newsgroup programs study guides test solutions


university texas austin department computer sciences faculty recruiting 1996 97 image tower recruiting department computer sciences university texas austin invites applications tenure track positions levels assistant professor level candidates hold making satisfactory progress ph equivalent degree computer science related area reasonable expectation completion august 31 1997 offers employment contingent completion ph degree requirements date successful candidates expected pursue active research program perform graduate undergraduate teaching supervise graduate students department ranked top 10 computer science departments country 30 tenure track faculty members areas computer science participates university computational applied mathematics interdisciplinary program austin capital texas located colorado river edge texas hill country live music outdoor recreation attractions beautiful area austin center high technology industry including companies ibm dell motorola sematech ti amd mcc tandem applicants submit curriculum vitae statement research interests list references representative publications professor simon lam recruiting committee chair department computer sciences university texas austin austin tx 78712 1188 applications accepted positions filled email inquiries application directed faculty recruit cs utexas maintain www home page include url curriculum vitae letters reference solicited separately evaluation applications begin december 15 1996 anticipate interview extended selected applicants january 1997 women minority candidates encouraged apply university texas equal opportunity employer


sean landis cs718 project fall 1995 content based image retrieval systems interior design table contents introduction background manual image analysis automated image analysis image features indexing queries current research feature extraction query specification distance metrics indexing extensibility artificial intelligence maximizing domain knowledge project overview project definition storage manager analysis manager query manager display manager user interface image menu view menu query color algorithms query pattern algorithms results color queries pattern queries user interface design limitations conclusions usefulness future work references introduction computers beginning replace photographic archives preferred form repository computer based image repositories provide flexibility attained collections printed images recently explosion number images computer users number increases users require sophisticated methods retrieval content based image promises fill requirement diverse areas play key role images 1 art galleries museum management architectural engineering design interior design remote sensing natural resource management geographic information systems scientific database management weather forecasting fabric fashion design trademark copyright database management law enforcement criminal investigation picture archiving communication systems education entertainment applications attracted attention researchers disciplines background content based retrieval based understanding semantics objects collection semantic analysis performed object inserted collection semantic representation objects collection user compose query retrieves set objects similar semantics query analysis performed index structure summarizes data collection content based image retrieval semantic analysis retrieval images semantic analysis involve manual intervention automated manual analysis involves human interpretation associate semantic properties image automated semantic analysis extracts image features correlated semantic meaning image analysis methods advantages drawbacks manual image analysis traditional databases text key words labels efficiently access large quantities text data complex text data automatically summarized labeled natural language processing artificial intelligence 5 data images text summarizing data labels considerably difficult repository news photographs user pose query give photographs president communist leader support queries images require labeling people images title political alignment humans process electromagnetic signals convert highly detailed semantic interpretations human analysis required generate labels support sophisticated queries problems human analysis personal perspective person interpretation important features image match person interpretation personal perspective leads variance image analysis labeling domain mismatch person domain interest influence image feature selection analysis interface expressiveness human computer interfaces provide limited bandwidth expressive capability image analysis os limited expressiveness interface data entry errors humans error prone set task tedious redundant problems automate image analysis intervention required user limited set unambiguous choices automated image analysis automated image analysis calculates approximately invariant statistics correlated semantics image data statistics color histograms invariants shape moments edges statistical analysis information image costly human interaction appeal automated image analysis suffers drawbacks primary problem statistical analysis extracted features support specific type query features apply domain posing general purpose queries diverse data sets image database indexed color histogram image feature vector generated element vector represents percentage color quantum found image element vector representing red green blue practice color feature vector requires elements feature vector image quantized percentage red green blue greater accuracy feature vector greater cost indexing comparison database contained fabric images color histogram powerful pose query user interested designing men casual shirt spring bright spring colors query posed desired color mix fabrics similar mixes colors retrieved hand database contained news photographs earlier color histograms semantics images database correlate color histograms image features image feature piece semantic information extracted image properties measuring quality feature capacity number distinguishable images represented 7 maximal match number maximum number images query possibly retrieve 7 complexity amount computation required determine images similar feature compactness amount space required store compare feature image features categorized primitive logical 1 primitive feature low level statistical attribute image object color histogram primitive features automatically extracted directly image logical feature represents abstract attribute label grass assigned region image logical features rely information contained image delineation primitive logical features clear image 2d representation 3d scene objects features representing objects primitive logical features extraction generates feature edge information primitive feature hand extraction identifies object utilizing model based approach logical feature primitive features basis generating logical features common system architecture layers logical feature extraction top primitive extraction primitive features extracted directly image generate image information abstract logical features generated 6 process dividing image regions correspond structural units interest 10 indexing queries goal indexing create compact summary database contents provide efficient mechanism retrieval data summary data based feature vectors content based visual databases items images objects represented pre computed visual features key attribute image feature vector corresponds point multi dimensional feature space search based similarities feature vectors achieve fast effective retrieval requires efficient multi dimensional indexing scheme 11 multiple indexing schemes required support queries involving combination features utilize multiple indexes hierarchical approach component query applied index higher layer merges results presentation user queries posed fuzzy fashion user typically interested results similarity equality requirement influences indexing scheme methods feature comparison means queries solicited user image similarity determined computing distance measure query feature vectors index structure similar images ranked distance thresholding reduce number similar images presented user query created composing primitive logical feature vectors present simple structured query environment systems define query classes typical query classes 1 color partial histogram created colors percentages 3 6 7 12 13 texture texture features include randomness regularity color distribution contrast complexity 5 12 13 sketch user creates sketch representing outline matched dominant image edges 3 12 shape shape created simple painting tools shape compared objects images similarity 3 4 12 13 volume volumetric relationships 3d tools feature vectors 3d information spatial constraints feature vector topological relationships objects image browsing user presented structured method viewing entire database objective features objective features attributes date image acquisition light direction view direction features lend methods traditional databases 5 9 subjective features feature extraction manual semi automatic subject human interpretation examples region labels manual object identification 5 9 motion motion applicable series images video segments motion features measure movement objects sequences movement camera viewpoint camera focal point 3 text simple complex text images simple case traditional database methods complex systems natural language processing artificial intelligence reason text annotations 5 domain concepts domain information lends specific forms feature vectors queries query classes provide meaningful user create feature vectors correspond notion image semantics queries composed multiple query classes alternative user composed queries queries user submits query form prototype image system feature vector query class es session begin user composed queries refined query run interactive query system called query image content qbic click current research large number researchers exploring related topics focused recent work productive sections describe important topics studied feature extraction feature extraction performed image added database systems provide support multiple query classes 5 6 features characterize images mit image retrieval system core system 6 retrieval engine supports wide range features including visual browsing color similarity measures text primitive features combined create level logical features call concepts qbic system 3 12 extracts features support image query classes color texture shape sketching location text system supports set video oriented query classes color histograms extraction methods issue dimension color feature vector number colors typical numbers range 64 256 dimensions 256 number unique colors representable byte higher dimension feature vector greater capacity values bin color histogram total number pixels percentage pixels color entire image query specification papers read treated query specification secondary issue researchers recognized simple ways queries unlike text based databases desired information retrieved single query suitable image require queries systems typically return images selection user systems user select images query query refinement researchers exploring ways providing easy refinement queries yield high success multiple query classes compose query interests researchers systems claim support composite queries papers explained combine query classes successfully distance metrics image query classes rely similarity metrics exact matching distance metrics produce relative distance image feature vectors threshold determine features similar cases user control threshold relax constrain query distance metric advantages drawbacks stricker 7 analyzes common distance metrics l1 l2 euclidean norms l1 norm computes distance element color histograms l2 norm computed stricker states l1 metric results false negatives images similar color composition retrieved l1 metric color similarity account metric similar l2 metric results false positives histograms bins close histogram retrieved qbic system 12 64 256 dimension color histogram element percentage color distance histogram database image histogram computed transpose operator locations distance color color ibm ultimedia manager 13 64 dimensional vector color percentages dimension represents range color space analysis time color pixel quantized 64 ranges based location rgb space indexing research area image feature indexing difficult problems solve image features typically high dimensional requiring complex multi dimensional indexing traditional indexing assumes exact matching similarity matching indexing structure finally difficult combine multi dimensional similarity based indexing methods efficiently support queries composed query classes similarity metrics initial indexing 5 avoid problem combining query classes metrics similarity encoded clusters image regions tree structure distance measured ancestral distance clusters effect normalizing query classes treated identically extensibility systems extensible overcome indexing methods query specification feature extraction important work lies ahead importance extensibility recognized wu al 6 developed core based generic framework multimedia dbms demonstrate flexibility architecture developed applications computer aided facial image inference retrieval system trademark archival registration system star medical information system development conclusion state object orientation important retrieval engine core advantage increase reusability codes increase reusability extensibility artificial intelligence research focuses applications artificial intelligence reasoning logical features similarity metrics index construction maintenance 5 apply ai annotating images dynamically select multiple feature models based user labels image regions system capable improving indexing structure based positive negative examples wu al 6 apply fuzzy reasoning queries logical features query partially defined user learning based experiences neural network model generate organizing nodes content based index tree system fuse composite feature measures support complex fuzzy queries maximizing domain knowledge query performance drastically improved cases assumptions made nature domain images database wu al observe core comprehensive functions application domain specific problems application development domain expertise added customize indexing retrieval module project overview exploration problems domain interior design interested methods apply problems faced interior designers interior designers work paint wallpaper fabric floor coverings follow general principles form space color style designers customers regularly face tedious chore manually searching matching materials general design principles taste opportunity high degree computer tasks designers compose queries primitive logical features constraints design principles results series queries wallpaper paint carpet consistent designer rules form space color style requirements led interest query classes color fabric wallpaper selected based color content perfect application color histograms texture floor coverings wallpaper fabric important components ideal queries based features shape examples shapes stripes floral patterns objective features styles victorian modeled objective features subjective features taste mood sensation related design concepts subjective feature queries examples feminine masculine cool warm text product attributes part numbers supplier information production date text features domain specific design rules domain specific features query powerful tool interior designers carpet sample designer find window covering carpet project definition implemented software prototype allowed explore areas color color important feature materials interior designers color automatic image analysis explored implementations color histogram feature vectors related similarity metrics pattern patterns important interior designers focused automated feature vector generation edge detection software design difficulties systems small number query classes provide flexibility support interior design technology image feature vectors similarity metrics indexing real world system extensible configurable object oriented techniques designed system encapsulates areas highest change created framework support addition query classes distance metrics framework divides major system tasks manager objects interact defined interfaces user interface defined simple user interface color histogram queries provided ability query color histograms shapes image management basic qbic system ability efficiently manage performance storage memory requirements images size complexity images special computation resource requirements identified issues suggest solutions specifically avoided exploring indexing issues project implementation implemented software prototype purpose exploring details software written microsoft tm visual compiler version 2 0 platform intel system running windows nt operating system version 3 51 software architecture shown block diagram architecture loosely based core 6 managers implemented object class definition restricts instantiation system wide object storage manager storage manager interface image database responsible maintaining memory virtual mapping images performing system specific operations class diagram 14 depicts key relationships class member functions access image database client store associate pixmap file image object store image database function process user request add image database pixmap image perform feature image clients request single image entire image database list function initialize object current implementation maintains unordered list image objects representing entire database real system maintain multiple indices retrieve images image objects leaves index case tree based index structure efficiency implementation loads pixmap data image image object determines load data task loading delegated image class image encapsulates details pixmap implementation feature vectors system manipulates image objects convenience pixmap class interface color pixel representation image pixmap class implementation screen image change affecting rest code features class features encapsulates set feature vectors class feature vectors added query classes added required production system efficiently manage memory current implementation loads demand large amounts physical memory typical pixmap requires 512 512 bytes memory store image data assuming 256 colors pixmap color table overhead making total bytes memory saver thumbnail versions thumbnails smaller representations 64 64 4096 bytes display current system requires entire image feature extraction support thumbnails require time tradeoff reduce large pixmap loaded memory disk space tradeoff thumbnails generated load time stored database analysis manager analysis manager performs analysis images added system result set feature vectors type query class greatest change system addition query classes analysis manager extensibility registration feature generate feature vectors class relationships shown class diagram user adds image system user interface calls analyze member function function create image analyzes calling extract installed feature feature objects added calling system initialized abstract class interface definition feature features concrete feature classes inherit interface provide implementations feature vectors generate feature object responsible analyzing image creating installing feature object image classes play important role encapsulate important information query class adding query class effort creating subclass classes query class specific information feature calls comparing images feature features important relationship initialization time feature installed instance init cpp tells feature position set feature vectors stored features objects tells features class feature vectors features object capable storing feature implementation large make data portion knowledge fashion features easily added query manager class important functions ability query database ability maintain query history query manager accepts features object user interface query formulated query retrieve similar images storage manager client requests initialized features object position size information feature fills information matched query client feature class defined query class similarity functions static member functions derived feature class passing member function pointer function argument accept features objects compute distance similarity functions return negative representing distance feature vectors function optionally return feature vectors dissimilar return rank images distance completes processing query passes ranked list images presentation current implementation similarity functions operate single query class specifics similarity computation external provide similarity functions account multiple query classes provide hierarchy queries results level queries passed similarity function display manager user interface display manager responsible displaying images screen tracking mouse selection images class closely related user interface provided operating system maintains list displayed images responds paint messages generated window system client display manager submit list images calling display replace existing list images held display manager list passed function images displayed note image lists manager objects maintain lists pointers image objects avoid memory leaks clients pass deletion policy display member function telling manage memory image list user interface typical menu options windows tm style screen capture showing application area filled wallpaper images click image label database file pixmap image menu image menu options adding images querying database selecting query option presents dialog designed solicit query query class screen capture shows dialogs compose query color composing color query multi step process involving dialogs query color dialog user 3 color percentages query color user manipulates controls color dialog standard windows dialog selection colors directly system color palette user create sixteen custom colors query composed user presses button query submitted similar images displayed view menu view menu selections user view information database images database item display entire image database real application impractical intelligent browsing tools traversing large set images selecting features item presents user image features dialog list box image names user selects image presses desired button display group screen capture shows button pressed color histogram dialog presents histograms selected image original image histogram color histogram image stored database bar represents relative number pixels assigned displayed color total color bins field number bins histogram total empty bins field number bins pixels image feature histogram histogram feature vector quantized version original histogram high percentage empty bins feature histogram common selecting pattern histogram button image features dialog presents pattern histogram dialog dialog shows directional bias image numbers bins represent relative biases direction integer values range 0 3 representing weak strong strong strong dialog shows image strongly biased vertically strongly biased horizontally color values item view menu presents user dialog viewing feature colors image color values dialog displays prevalent colors percentage distribution rgb color rgb values shown center quantization range dialog testing quality similarity function query color algorithms image added database calls extract member function object function responsible creating query class specific feature vector installing image creates 64 dimensional color histogram feature vector similar ibm ultimedia manager 13 element feature vector represents cube shaped subspace rgb space shown figure pixel quantized bins traversing image histogram number pixels contained color cube bin converted percentage representing relative number pixels contained color cube similarity function computes distance histograms l2 norm distance compared user definable threshold determine similarity return order images similar l2 norm works sparse matrices fine user colors dialog entries values compared querying similarity function ignores small percentages present histograms reducing problem false positives due contribution insignificant differences histograms query requires larger similarity threshold involves comparisons queries dialog data 9 0 24 0 worked color queries 25 0 40 0 good query query pattern algorithms query pattern algorithms automatically recognize directional biases image image added database calls extract member function pattern class pattern creates 3 dimensional feature vector element percentage bias horizontal diagonal vertical directions pattern extraction algorithm multistep process creates greyscale copy original image rgb values converted brightness values translation black white television television images transmitted color scale black white television display portion luminance signal greyscale image processed detect edges sobel operator 10 method applies 3 3 kernels pixel estimate brightness derivatives db dx db dy derivative horizontal direction kernel 1 0 1 1 0 1 1 0 1 vertical direction kernel 1 1 1 0 0 0 1 1 1 conceptually kernel applied image sliding kernel image summing products values kernel brightness values result derivative brightness slope pixel center kernel application kernels pixel magnitude computed assigned pixel center kernel emphasize edges algorithm thresholds black white image result process finally edge image traversed applying kernels time derivatives stronger bias image direction slope determine pi algorithm direction bins histogram process applied entire image sums bins converted percentages result feature vector percentages bias horizontal diagonal vertical directions distance metric ranks direction biases strong strong strong weak computes l1 norm distance histograms distance compared user definable threshold determine similarity returned distance order similar images results results project positive scanner produce line 50 wallpaper samples implemented software supported color pattern based queries wallpaper database software intuitive user interface supports easy addition query classes color queries ways query database color dialog query color dialog dialog query user selected colors demonstrates effectiveness query images returned order similarity based query color histogram displayed wallpaper sample query key user clicks mouse button desired presented popup menu selecting query color initiate retrieval wallpaper image threshold set 38 pattern queries software supports pattern queries based queries initiated popup menu query based wallpaper sample results set strong directional bias vertical horizontal directions query restricted display 10 images current implementation provide capacity distinguish directional bias lines bias noisy patterns require feature extraction algorithm smoothing step noise performing gradient computations user interface user interface fairly intuitive interface presents familiar environment windows user microsoft windows interface guidelines sample user unfamiliar image processing easily system user confused meaning threshold parameters set numbers confusion presenting control representing scale relative distance design software design takes full advantage object oriented principles key features design change encapsulated area greatest change addition query classes functionality encapsulated feature concrete classes query class added copying existing feature modifying suit query class implemenation details encapsulated classes hide implementation details pixmap support multiple image types pixmap converted abstract class providing interface specific image types inherit class class hides details database operating system responsible logical image management full featured application delegate system details class manage images abstraction enforced abstraction enforced defined manager classes interface inheritance eases expansion abstract class defines interface concrete feature client code written interface knowledge query class specific details design principles produced extensible embeddable system prototype made embeddable converting server client server arrangement user interface code code sensitive change properly resides client application client server communication protocol microsoft windows environment ole provide capability limitations limitations prototype performance resource management adding image database takes long time image analysis current algorithms optimized step expensive perform real time production system feature vectors batch processing mechanism image management crude production system entire image database loaded memory mechanism exists maintaining working subset images support thumbnail versions images size image software scales display software prototype intended exploring ideas polish required production systems conclusions project goals met prototype system built demonstrating color pattern queries intuitive user interface ease object oriented design supports extensibility usefulness vast number images line quality systems critical system people quickly find image field interior design designers customers search hundreds carpet paint wallpaper samples selections combined create pleasing result producing result requires searching designers access vast amounts material cd rom vendor database rapidly create high quality interior solutions sophisticated query environments assist applying practical design constraints ensure attractive results expensive sample obsolete significant savings passed customers future work system interior design requires access large databases flooring paint fabric wallpaper samples efficient retrieval multiple large image databases relies data representations indexing methods methods support queries composed multiple query classes query classes needed support aspects interior design materials classes color texture pattern style needed create designs text attributes represent manufacturer information wear characteristics cost judicious artificial intelligence improve system performance fuzzy logic determining image similarity query classes expert systems built assist designers creating solutions conform traditional design idioms finally sophisticated user interfaces needed give designers power flexibility work demands users incrementally build design solutions interface provide access designers portfolio modify past work allowing quick response customer demands challenges ahead future systems field interior design presents challenges results work show promise references 1 venkat vijay raghavan content based image retrieval systems ieee computer september 1995 2 desai special section content based retrieval multimedia systems 1995 3 1 2 3 niblack al query image video content qbic system ieee computer september 1995 4 rajiv mehrotra james gray similar shape retrieval shape data management ieee computer september 1995 5 vision texture annotation multimedia systems 1995 3 3 14 6 wu desai lam gao core content based retrieval engine multimedia information systems multimedia systems 1995 3 25 41 7 markus stricker bounds discrimination power color indexing techniques proceedings spie storage retrieval image video databases ii 1994 15 24 8 nagarajan ramesh sethi feature identification aid content based image retrieval proceedings spie storage retrieval image video databases iii 1995 2 11 9 virginia micheal stonebraker retrieval relational database images ieee computer september 1995 40 48 10 john russ image processing handbook edition crc press 1995 11 hong jian zhang di zhong scheme visual feature based image indexing proceedings spie storage retrieval image video databases iii 1995 36 46 12 jonathan ashley ron barber myron james denis lee wayne niblack automatic semi automatic methods image annotation retrieval qbic proceedings spie storage retrieval image video databases iii 1995 24 35 13 harold treat ed jean ho mimi vo jing song jang laura hall frank tung searching images ultimedia manager proceedings spie storage retrieval image video databases iii 1995 204 213 14 james rumbaugh michael william frederick eddy william object oriented modeling design prentice hall 1991 cs718 description send questions comments sean landis scl isis modified 12 7 95 sean landis


publications funded part project 8 buffer latency tradeoff video servers soloviev international workshop multimedia information systems west point ny september 26 28 1996 review 7 disk scheduling video servers soloviev international workshop multimedia information systems west point ny september 26 28 1996 review 6 scheme bit rate traffic control atm networks choi vetter proceedings 21st local area networks conference minneapolis minnesota october 13 16 1996 submitted march 1996 review 5 database query processing high speed networks perrizo vetter zhang international journal systems sciences special issue distributed systems review 4 tm lab experimental program viewing investigating thematic mapper imagery pc sanchez canton perrizo vetter poster 13 symposium eros data center sioux falls south dakota august 19 22 1996 3 survey congestion control schemes abr traffic atm networks choi vetter data communications management october 1996 2 aspects distributed database management high speed network environments vetter perrizo proceedings 11th international conference systems engineering icse 96 las vegas nevada july 9 11 1996 1 emerging technologies distance education vetter tong proceedings 29th annual small college computing symposium sccs 96 st cloud university st cloud mn april 18 20 1996 img img img img img img img img img


presentation microsoft brain child supposed world definitive answer object technology microsoft ole basis version windows nt real 32 bit os ms code named cairo ole open standard depending microsoft open disagree microsoft made information ole internet opendoc overview opendoc backed companies computer industry standard controlled organization called labs opendoc positioned component architecture exceeds capabilities microsoft ole opendoc supporters companies officially jumped opendoc bandwagon companies organizations contributed time money helped implement apple ibm corp labs novell wordperfect taligent adobe borland microsoft foundation classes mfc overview foundation classes thin wrapper windows 16 bit 32 bit api classes utility classes implement base functionality prove project linked list implemented classes addition features part mfc cross platform aspect libraries libraries application development required mac os compliant version simple recompile code platform differences hidden mfc foundation class supporters microsoft gatekeeper libraries development ships visual product symantec symantec licensed classes microsoft ship compiler product borland borland added compiler support class libraries support standard extensions microsoft compiler ship libraries included borland ships class libraries object windows libraries compiler updated 12 september 1995 jmm cs cornell


6624 interesting places visit jump general resources jump uw madison resources jump virus information jump books jump genealogy jump software jump fun stuff general resources switchboard find person usps zip code lookup address information internet utilities internet catalog www virtual library einet galaxy planet earth home page special internet connections yanoff yahoo free internet encyclopedia uniform resource locators computer science bibliography collection local resources uw madison wi www servers home pages university wisconsin madison badger herald web site wiscinfo web server uw madison wiscinfo gopher virus information virus information library computer virus myths books speculative fiction clearing house sf resource guide sf fantasy line books page borders books homepage tor books electric bookstore future fantasy genealogy genealogy home page rand genealogy club home page genealogy online genealogy www faq index roots kansas genealogy genealogy ireland slow brunswick genealogy adoption information gopher illinois land sales html html html linear data file converter unix national archives library congress www home page global heritage center maps xerox map server place names links maps geographic names information system geographic server software simtel msdos software simtel windows software st louis mo pc archives corvallis pc archives umass lowell pc games archive umass lowell pc games archive mirror fun stuff usenet oracle resource index searchable archive comp infosystems www announce virtual tourist world map comics space shuttle clickable map


advanced computer architecture focuses techniques quantitative analysis evaluation modern computing systems selection benchmarks reveal compare performance alternative design choices system design emphasis major component subsystems high performance computers pipelining instruction level parallelism memory hierarchies input output network oriented interconnections students undertake major computing system analysis design project choosing administrative information unique number meeting place mwf 2 3 wel 2 304 instructor mike dahlin office hours mw 3 4 appointment tay 4 136 ta tbd ta office hours tbd readings textbook hennessy computer architecture quantitative approach edition note 2nd edition significantly 1st edition recommended attempt 1st edition textbook errata sheet hennessy patterson addition read current papers aspects current computer architecture research watch space pointer reading list grading 10 class participation 30 homework work pairs 30 exams 2 midterms 30 project work pairs schedule week date topic reading due intro admin 1 jan 13 review perf cost ch 1 amdahl law tech trends caching memory holiday 2 jan 20 pipelining ch 2 hazards branch hw 1 prediction 3 jan 27 pipelining hazards ch 3 project static branch prediction proposal 4 feb 3 ilp scoreboarding ch 4 hw 2 speculation ilp dynamic prediction 5 feb 10 limits ilp vector ch processors 6 feb 17 memory hierarchy ch 5 project survey 7 feb 24 memory dram vm hw 3 banks 8 mar 3 memory review midterm 1 9 mar 10 spring break spring break 10 mar 17 metrics queuing ch 6 busses disks raid 11 mar 24 tertiary networks hw 4 12 mar 31 networks ch 7 project checkpoint 13 apr 7 networks parallel hw 5 architectures 14 apr 14 mpps ch 8 15 apr 21 mpps review midterm 2 project presentations 16 apr 28 project fri day classes project written report additional resources pages products research conferences bibliographies tech reports yahoo business economy companies computers systems


introduction logic design fall 1996 announcements sept 30 don forget check usenet group regularly oct 28 ttl data book return 270 lab nov 22 problem quicksim crashing sparc 10 20 fixed nov 22 clean check haven nov 22 week thanksgiving 270 lab open regular hours monday tuesday regular hours 2 30pm wednesday closed thursday friday general information description lab schedule meeting times instructors office hours day handout homework solutions umich eecs class 270 newsgroup lab information data sheets lab experiment cover sheets cad quick reference hints send comments home page howard eecs umich university michigan department electrical engineering computer science


cs 3343 analysis algorithms syllabus instructor daily class schedule assignments textbook errata important dates tuesday august 27 frist class thursday september 12 assignment 2 due 2pm thursday september 19 assignment 3 due 2pm thursday september 26 assignment 1 due 2pm thursday october 3 exam friday october 25 drop date thursday october 31 assignment 4 due 2pm tuesday november 19 exam tuesday november 26 assignment 5 due 2pm thursday december 12 final exam 10 30am


3308 advanced database systems g22 goals internals tuning touch decision support study internals touch intersection database system operating system distributed computing research development specific databases support notion transaction multi step atomic unit work execute isolation manner theory practice transaction processing problem making happen efficiently reliably tuning activity making database system run faster capable tuner understand internals database system understand affecting performance database application interactions levels system index design concurrency control extremely important require optic database management design introduce research issues discussion tuning range hardware conceptual design touching operating systems transactional index selection query normalization decisions comparative advantage object oriented database systems discuss research areas query processing data structures decision support queries red sold england months formal prerequisite database knowledge sql definition normal forms fact sufficient systems interested area theory meets practice recent years offered year frequently finding references db literature web page pointers database literature good place start database research instructor dennis shasha professor computer science york university courant institute mathematical sciences holds yale syracuse ph harvard written books database tuning principled approach mathematical detective stories adventures dr codes puzzles conspiracy minds lives discoveries 15 great computer scientists main research projects combine databases parallel processing persistent linda project databases pattern recognition combinatorial pattern discovery project databases expert systems information retrieval thinksheet project questions send shasha cs nyu office hours monday class warren weaver 424


cse 543 computer system performance modeling spring 1996 hosts ed lazowska mary vernon home page cse 543 computer system performance modeling cse 543 meets mondays wednesdays fridays 1 30 2 20 loew hall 115 office hours tentative topic schedule assignments project information map queueing network solution package email information 1996 acm sigmetrics conference measurement modeling computer systems uw department computer science engineering lazowska cs washington


cs161 data structures algorithms description efficient algorithms sorting searching selection algorithm analysis worst average case analysis recurrences asymptotics data structures balanced trees heaps algorithm design techniques divide conquer dynamic programming greedy algorithms amortized analysis algorithms fundamental graph problems depth search connected components topological sort prerequisite 109b instructor guibas autumn 1995 96 materials information quarters offered 1995 96 autumn plotkin tth 1 15 2 30 spring guibas tth 9 30 10 45 summer goldwasser tth 1 15 3 05 units 4 3 units graduate students modified tuesday april 9 1996 5 07 33 copyright 1996 stanford university www cs education webmaster www cs education cs stanford


cse 521 computer architecture class meeting time place lecture tuesday thursday 1 15 2 30 pm 155 debartolo hall lab tuesday wednesday thursday 2 45 4 15 254 fitzpatrick hall instructor dr jay brockman 352 fitzpatrick hall x1 8810 jbb cse description text hennessy patterson computer architecture quantitative approach 2nd edition morgan kaufmann publishers san francisco 1996 lecture notes cse 322 undergraduate computer architecture ii introduction hardware firmware implementation algorithms hardware firmware implementation control single cycle mips processor multiple cycle mips processor pipelining pipelining continued hazards memory hierarchy interfacing processors peripherals memory lecture notes construction homework design projects homework 1 hardware firmware implementation algorithms due 2 2 96 homework 2 control system design due 2 2 96 homework 3 processor metrics instructions set architecture hennessy patterson exercises 1 1 1 4 1 7 1 14 2 1 2 3 2 10 2 11 due 2 20 96 newsgroups courses newsgroup courses cse322 newsgroup undergraduate architecture cse mentor questions answers mentor graphics cad tools links construction jay brockman 1 modified 1 24 96


cse 1001 fundamentals software development fall 1996 general information instructor ryan stansifer contact info http www cs fit ~ryan mail address ryan cs fit lectures lectures 11 00 12 15 tuesdays thursdays 106 aeronautics building lab sections class divided lab sections meet cs pc lab 332 crawford science building labs meet 13 30 15 20 tuesday 10 00 11 50 15 00 16 50 wednesday lab instructor juan cs fit class urls http www cs fit ~ryan http www cs fit lab htm catalog description cse 1001 introduction software development applies small programs students learn program higher level language learn read understand write evolve typical small higher level programs goals class expect students learn makes computer science write simple programs ada programming language solve problems computer class prerequisites document detailed list topics covered class students wide variety backgrounds vastly experience consequence students bored lost patience support classmates participation class appreciated textbook textbook class nell dale chip weems john mccormick programming problem solving ada heath lexington massachusetts 1994 isbn 0 669 1 follow book closely expect cover chapters text 12 time permits cover additional material book diskette ada programs appearing book programs www information net simplified syntax defines basic portion language roughly portion ada covered ada 95 language reference manual hypertext version revised international standard iso iec 1995 information technology programming languages ada ada 95 rationale faq frequently asked questions ada ada core technologies developers gnu ada translator gnat gnat local copy bytes ada mode emacs perl script case run gnat tuck ada information clearinghouse home page special interest group ada www page world wide web home page acm information pointers source information ada including ada related jobs information augusta ada bryan programs appearing programming problem solving ada dale weems mccormick local copy programs ada ide graphical ide windows 95 nt port gnat ada 95 compiler released terms gnu general public license includes borland delphi 2 0 source code ada compiler ada compiler gnat compiler cs pc lab 332 account tuck cs fit ada compiler large fast computer gnat compiler free load distribution ada core technologies www page programming style lengthy detailed document www http www cs fit ~ryan style txt specific advice writing clear ada programs times advice ada program considered completely correct model clarity good style shorter extract document handed lab lengthy detailed guide development constructed programs general found book full practical advice examples bad good program fragments pascal steve mcconnell code complete microsoft press redmond washington 1993 isbn 1 484 4 classwork addition lab projects class midterm examinations final encouraged read textbook preparation class work exercises end chapters grading midterms final class lab projects count 45 total grade midterm count 10 final 25 exam lab project assigned numeric score average numeric score roughly equivalent letter grade letter grade class assigned student based weighted sum numeric scores grade determined rest class magnitude numeric scores work tests explain answers tutoring humor student numeric scores lab assignments exams recorded question standing class score recorded wrong contact immediately corrections made long due dates grade distribution past grade distribution looked fall 1994 fall 1995 5 15 12 25 11 32 18 38 10 29 12 25 4 12 3 6 5 15 3 6 34 48 calendar important dates aug sep oct tu tu tu 1 2 3 1 2 3 4 5 6 7 1 2 3 4 5 4 5 6 7 8 9 10 8 9 10 11 12 13 14 6 7 8 9 10 11 12 11 12 13 14 15 16 17 15 16 17 18 19 20 21 13 14 15 16 17 18 19 18 19 20 21 22 23 24 22 23 24 25 26 27 28 20 21 22 23 24 25 26 25 26 27 28 29 30 31 29 30 27 28 29 30 31 nov dec tu tu 1 2 1 2 3 4 5 6 7 3 4 5 6 7 8 9 8 9 10 11 12 13 14 10 11 12 13 14 15 16 15 16 17 18 19 20 21 17 18 19 20 21 22 23 22 23 24 25 26 27 28 24 25 26 27 28 29 30 29 30 31 tuesday august 27 1996 lecture thursday august 29 1996 advisor advisee class monday september 2 1996 classes labor day holiday thursday september 19 1996 midterm chapters 1 4 tuesday october 15 1996 midterm chapters 5 6 tuesday november 12 1996 midterm chapters 7 9 thursday friday november classes thanksgiving holiday 28 29 1996 tuesday december 10 1996 final exam chapters 1 12 3 30pm 5 30pm quote dijkstra programmable computer extremely handy device realizing conceivable mechanism changing single wire core challenge computing science conceptual abstract mechanisms lost complexities making dijkstra cultural gap mathematical volume 8 number 1 1998 page 49 ryan stansifer ryan cs fit document location http www cs fit ~ryan modified thu nov 21 13 20 26 est 1996


1998 finding information retrieval technologies seeking knowledge richard belew visiting professor cs838 lecture 2 univ wisconsin computer science department fall 1996 tue thurs 8 30 9 45a call room engr designed students interested understanding information retrieval ai esp knowledge representation machine learning techniques underlying exciting activity occurring world wide web complete description abstract syllabus major topics considered graphical map related tentative schedule semester proceed resources readings overview part 1 postscript 56k overview part 2 postscript 64k political image postscript assignments class email suggestions composing email class related www resources class minutes students students modified belew cs wisc 17 sept 96


principles computer science taught buckles department electrical engineering computer science room 304a stanley thomas hall office hours 2 00pm 3 30 mw phone number 862 3373 email buckles eecs tulane text stewart lee algorithms data structures computer engineering jones bartlett publishers boston 1991 language texts required large expensive textbooks good long term reference jeri hanley elliot problem solving program design edition addison wesley publishing company reading ma 1996 tom james kenneth jr structured engineering technology edition prentice hall englewood cliffs nj 1995 richard martin applications programming ansi edition prentice hall upper saddle river nj 1996 small texts good study peter van der linden expert programming sun soft press moutain view ca 1994 engineering problem solving ansi prentice hall englewood cliffs nj 1995 steven programming west publishing company minneapolis st paul mn 1995 invest book titles begin absolute beginners end dummies handouts eecs guidelines students general departmental policies written programming assignments posting grades importantly academic honesty postscript 12k computer resource policies rules legitimate departmental computers information accounts directions obtaining additional information loads additional information including introduction unix change password printing syllabus postscript 46k final exam thursday 19 december 8 00 noon quiz solutions programming assignments assignments due date program 1 sept 9 oct 9 program 2 oct 9 oct 30 program 3 nov 1 nov 22 program 4 nov 25 dec 6 homework assignments assignments due date homework 1 sept 18 oct 2 solutions homework 2 oct 7 nov 4 solutions homework 3 nov 6 dec 6 solutions interesting links related harvey mudd college depaul university alley oop ee cs courses


eecs 661 discrete event systems eecs 661 web page fall 1996 offering homepage maintained instructor professor stephane lafortune john eecs 661 offered year fall semester intended eecs graduate students learn modeling analysis control discrete event dynamical systems des dynamical systems discrete state spaces event driven dynamics des arise modeling technological systems automated manufacturing systems computer systems communication networks information documents information lib user guide modified 1996 09 26


topics theoretical computer science computer science 85 times 97w 98w arrange instructors stein prerequisite computer science 25 permission instructor required recommended prerequisite vary term consult department topic 97w 98w dist qds year advanced topic theoretical computer science offered topics covered recent years include combinatorial optimization computational geometry cryptography network flows distributed algorithms students receive credit computer science 85 back dartmouth cs home page


database systems home page 1996 cos 425 spring semester number visitors january 5 1996 web pages advantage netscape features home page cos 425 latest information class mind document static information added frequently questions send mail staff personnel instructor ta students information class updates information messages updated frequently homework assignments project information links places cmsc 424 university maryland college park cs 266 university illinois urbana cs 127 university michigan dearborn cs 266 university california berkeley cs 127 brown university cs 285 university southern california database offerings graduate level cmsc 724 database management systems university maryland college park cmsc 624 database systems implementation university maryland college park links research development areas related databases watch future additions pointers db related resources click active databases university florida university michigan university colorado boulder politecnico di milano italy heriot watt university uk university linz austria data warehousing stanford university data warehousing conference database benchmarks tuning performance 007 benchmark university wisconsin tpc benchmarks sequoia benchmark university california berkeley city university london prima project oopsla 95 workshop benchmarks performance database security authorization george mason university politecnico di milano italy data knowledge mining discovery gte labs ibm almaden research center university california los angeles los national lab university british columbia canada web sites data mining knowledge discovery distributed data management university california berkeley university maryland university florida university erlangen germany indexing techniques northeastern university intelligent deductive databases university wisconsin university california los angeles georgia tech politecnico di milano italy heriot watt university uk multidatabase systems university waterloo canada queen university canada multimedia databases university minnesota university california los angeles oregon graduate institute university massachusetts indiana university politecnico di milano italy irst italy university italy heriot watt university uk ibm almaden research center garlic project text image video ibm almaden research center gmd germany university erlangen germany technical university darmstadt germany university alberta canada object oriented databases university wisconsin university michigan brown university university virginia gte laboratories inria france university alberta canada university manitoba canada university twente netherlands politecnico di milano italy university linz austria eth zurich switzerland linkoping university sweden object database management group oopsla 95 workshop parallel distributed databases university wisconsin university twente netherlands heriot watt university uk spatial databases university wisconsin politecnico di milano italy heriot watt university uk university waterloo canada university minnesota transaction models management traditional advanced university massachusetts recovery shared memory dbms university massachusetts language support extended transactions eth zurich switzerland technical university darmstadt germany oregon graduate institute university massachusetts acta framework university massachusetts epsilon serializability university massachusetts semantics based cc live computer science department www topics information hypertext markup language html uniform resource locators url read web home lynx character based web browser cos 425 database systems home page cs princeton class location time


cse ee 576 image understanding 576 home page world wide web web short hypermedia document cse ee 576 information class mind document static information class messages added frequently problems document send mail mock cs copyright notice material web subject copyright viewed public installed web site university washington assignments assignment read chapter 1 notes exercise 5 assignment due wednesday april 5 read chapter 2 notes exercises 1 7 determine convenient run khoros cantata cse runs suns edit local workstation login file xhost add cshrc file suns setenv khoros home usr local khoros setenv manpath usr local khoros man set path khoros home bin path rlogin assignments display environment variable set appropriately type cantata unix prompt ee machine george khoros cantata installed home page www http www cs washington education courses 576 index html follow links khoros cantata tutorial outline experiments topics image information spatial resolution ideal tutorial read web pages experiment khoros window turn part assignment assignment read article lin pp 62 69 cvpr 94 proceedings article wolff pp 369 376 fourth assignment due monday april 17 assignment make comparison image processing software environments khoros msvc image matlab image processing toolbox objects assignment 1 gain experience environment 2 begin feel strengths weaknesses environments 3 explore convolution noise suppression edge detection environment select monochrome test image apply sobel operation test image apply moving average filter test image apply 3 3 laplacian test image simulate gaussian smoothing larger standard deviation iteratively applying moving average filter apply 3 3 laplacian gaussian smoothed image describe results obtained terms appearance objects contours test image describe aspects implementation menu selections direct manipulations programming perform experiments fast operations ran level learning effort required part announcements final examination monday june 5 2 30 4 20pm regular class meeting room exam cover combination pre midterm post midterm material list topics study reminder class approved sunday june 4 1 30 2 30 time final exam review meeting plan meet sieg 422 outlines selected class periods friday 28 april monday 1 wednesday 3 monday 8 friday 12 monday 15 wednesday 17 friday 19 monday 22 wednesday 24 copies overhead transparencies 22 24 lectures neural nets engineering library copy center 2nd floor cse ee 576 packet number 2 trainable classifiers friday 26 students 576 permitted temporary copy matlab require fill form sign contract interested term projects important part started week april 24 corrections notes friday april 7 introduced pentium laboratory including msvc software development environment evan mclain document explaining add transform image application current status khoros installation suns recent information started khoros accompanying dip read class friday march 31 monday april 3 students computer account access khoros cantata contact renee reed thursday friday make arrangement pick account login password weekend early week renee hours limited plan ahead email address reed cs part sieg 127 back office sieg 127 locked knock prior arrangement meet account application cards signed care week selected lecture slides monday march 27 wednesday march 29 information resources image understanding online intro image processing khoros cantata delft univ pattern recognition information page computer vision home page stored cmu information home page department computer science engineering online version computer science undergraduate brochure online version computer engineering undergraduate brochure mosaic running mosaic mac find items mac balloon menu home page item navigate menu update 31 1995


cs 726 726 math 726 stat 726 nonlinear programming theory applications fall 1996 schedule lecture 8 50 9 40 mwf 1257 cs mail cs726 1list cs wisc url http www cs wisc 1 instructor michael ferris office 6391 cs telephone 262 4281 mail ferris cs wisc office hours 10 00 11 00 monday tuesday wednesday teaching assistant yuh jye lee office 1307 cs telephone 262 6602 mail yuh jye cs wisc office hours 12 00 1 00 wednesday 2 00 4 00 thursday class text nonlinear programming olvi mangasarian siam publishers philadelphia 1994 texts nonlinear programming theory algorithms shetty edition wiley york 1993 nonlinear programming bertsekas athena scientific 1996 general information overview introduction linear inequalities theorem alternative convex sets convex concave functions optimality criteria differentiable convex concave functions order optimality criteria order optimality criteria duality nonlinear programming generalizations convex functions optimality conditions exact penalty augmented gradient projection books reserve kurt wendt library assignments grading homework assignments 35 grade 1 assignment week midterm examination november 4 8 50 9 40 25 grade final examination 40 grade homework assignments homework 3 homework 4 homework 5 homework 6 mathematical programming uw home page courses page updated periodically semester


cse 121 131 home page programming languages techniques ii spring 1996 news group lectures homeworks labs exams miscellaneous grades indexed 5 digits social security lecturers peter peter cis upenn office moore 562 cse 121 001 mwf 10 11 office hours mw 11 12 val tannen val cis upenn office moore 561 cse 121 002 mwf 11 12 office hours 3 4 2 30 3 teaching assistants scott alexander gradient cis upenn cse 131 108 mw 3 4 102 tth 12 1 office hours 11 12 gradient cis upenn cse 131 107 mw 2 3 104 tth 2 3 office hours 4 5 gradient cis upenn cse 131 105 mw 12 1 106 mw 1 2 office hours 2 3 tom gradient cis upenn cse 131 101 tth 9 30 10 30 103 tth 1 2 office hours 10 30 11 30 note ta office hours held moore 109 cets labs cse 131 students administrator susan online resources cse 120 home page img


img cse 370 introduction digital design autumn quarter 1996 gaetano borriello corey anderson cse 370 home page home page cse 370 web bunch information class mind document static information class announcements messages added frequently problems document cse 370 web general send mail cse370 webmaster cs class announcements notices instructor ta system administrators update 11 11 96 12am class mail archive messages cse370 cs washington update 11 21 96 01pm send mail class instructor ta instructor ta administration goals syllabus meeting times lectures mwf 8 30 9 20am eeb 108 final exam monday december 16 8 30 10 20am eeb108 workload grading expectations pc laboratory software tools policies collaboration cheating announcements mail addresses schedule lecture topics instructor gaetano borriello gaetano cs office hours 12 30 1 20 sieg 212 ta corey anderson corin cs office hours 2 30 3 20 tth 8 30 9 20 sieg 326a weekly assignments bi weekly quizzes final exam lectures online versions slides lectures textbook contemporary logic design katz benjamin cummings addison wesley 1994 web maintained author katz web maintained publisher benjamin cummings addison wesley notes topics interest evolution implementation technologies computer aided design cad tools logic design synario feedback things anonymously desire links previous quarters cse 370 portions cse 370 web reprinted adapted academic nonprofit purposes providing source accurately quoted duly credited cse 370 web copyright 1996 department computer science engineering university washington comments cse370 webmaster cs washington update 11 17 96


410 operating systems fall 1996 time mwf 3 00pm 3 50pm location 232 harvey bright bldg instructor teaching assistant udo pooch harvey bright bldg harvey bright bldg 845 5498 845 3858 mail pooch cs tamu mail cs tamu office hours tentatively 1 00 office hours 10 00 3 00pm 12 00 schedule slides tests homeworks projects required textbook operating systems concepts fourth edition galvin addison wesley textbook closely purchasing strongly recommended reference books modern operating systems tanenbaum prentice hall design unix operating system bach prentice hall reserve operating systems stallings reserve theses books complement textbook required perusing understanding issues discussed class books reserve library late submission policy submission deadlines included extra time consideration accidental events limited unavailable resource machines sickness students stock market collapse means additional extensions generally granted homeworks returned due day class projects submitted electronically lateness penalized earned points item class day context friday november 29 treated class day project talk operating systems build realize writing os code programming typical application racing driving mom law sunday don smell burning forget hold hand memory protection bad shape fortunately machines real people real work system support staff resent heavily started tinkering operating system machines semester playing improve simulated operating system simulation sophisticated simulates system detail implementation system concentrate os issues worry simulation exposed tricky situations foster understanding os environment projects written nice opportunity experience writing simple object oriented code simple object oriented standpoint code sophisticated students familiar short introduction important concepts class working knowledge assumed pages prone change notice consult regularly avoid surprises


cis 625 parallel programming spring 1996 web pages ve added description generic formal package parameter workaround ada 95 web page sources ftp directory ve added ada source ftp directory common ftp pub cis dwyer ada loose organization replicated worker stuff replicated ve added page related mid term final exams lists problems work ve added page ada 95 compiler overview fundamental advances computing performance dependent adapting programming techniques parallel computer architectures meet real time constraints improve response times computationally intensive tasks model physically parallel systems parallel programming techniques students professionals wide variety disciplines advanced undergraduates cis graduate students computing systems engineers building embedded systems scientists theoretical calculations benefit goal build knowledge data structures algorithms cis 500 expose student fundamental concepts concurrent distributed programming lectures nichols 127 mwf 1 30 2 20 pm instructors matthew dwyer virgil office nichols 324e email dwyer cis ksu www http www cis ksu phone 913 532 6350 fax 913 532 7353 office hours tr 10 00 11 00 prerequisites cis 500 requirements consist lectures readings programming projects exams lectures readings bulk concepts presented explained illustrated extended examples lectures readings serve provide details depth selected concepts lectures readings function integrated presentation material expected completed reading prior lecture advantage class time questions elaborate issues presented readings homeworks 4 programming projects working languages multi pascal concurrent ada 95 programming projects designed provide depth exposure concepts covered languages illustrate variety solution strategies group projects class students expected work discuss projects students share designs code data modules objects documentation specification requirements interfaces refer ksu campus phone book student life handbook governed guidelines procedures note passage instructor convinced evidence plagiarism cheating decide punishment instructor impose punishment ranging credit work exam class instructor recommend dismissal suspension recommendation carried undergraduate grievance board minimum credit work exam dishonesty occurred instructor draft memo student record provost office graduation indicating nature dishonest act examinations 1 hour class mid term exam 2 hour class comprehensive final exam final grades assigned based weighting homeworks 50 mid term 15 final 35 readings required readings include text book selected papers literature papers holdings university library lester art parallel programming prentice hall 1993 gehani concurrent software practice experience vol 16 9 sept 1986 gehani concurrent concurrent programming class es vol 18 12 dec 1988 gehani shared memory access concurrent ieee trans parallel distr systems vol 4 7 july 1993 peterson petri nets computing surveys vol 9 3 1977 additional reference materials include burns weller concurrency ada cambridge university press 1995 parallel programming introduction prentice hall 1993 krishnamurthy parallel processing addison wesley 1989 lovelace www based ada 95 tutorial http epfl ch ada tutorials lovelace lovelace html additional resources web pages linked home page include assignments solutions lecture notes links parallel programming pages organization schedule broken phases phase covering material lester text provide solid background fundamentals parallel programming phase cover number additional topics related parallel programming build foundation professor lecture phase professor dwyer lecture phase professor dwyer hold office hours cover topics motivation parallel programming parallelism disjoint parallel processes break problem problems solved basic concepts shared memory systems multiprocessor architectures process communication synchronization synchronous parallelism distributed memory systems communication system topologies asynchronous parallelism system performance amdahl law gustafson law measures speedup utilization throughput parallel programming languages survey language support writing parallel programs concurrent ada 95 concurrent programming paradigms common solution techniques software architectures parallel concurrent programs client server filters token passing formal models concurrent systems petri nets state space methods path expressions properties concurrent parallel systems distributed systems replication load balancing deadlock multi cast communication data driven parallelism data parallel programming vector processing automatic detection exploitation parallelism engineering concurrent software testing validating verifying concurrent systems reusable concurrent components schedule topics readings assignments dwyer cis ksu


cs 302 fall 1996 section 63 algebraic language programming dave eggleston email burnett cs wisc office cs st 1306 office phone 608 262 6601 office hours 3 00 4 00 11 30 12 30 announcements updated nov 10 19 30 note original output prog6 page errors days week correct values information exam 2 updated nov 10 questions asked program 6 class reading scan 9 1 thursday class program 6 solution quiz 3 grades page general information cs 302 home page objectives vectra lab cs 302 consultants syllabus working home class handouts grades homework exams quizzes miscellaneous archive policy information email policy grading policy late policy academic misconduct policy text problem solving object programming walter savitch addison wesley publishing company 1996 list errata modified wed aug 28 1996 dave eggleston burnett cs wisc based greg sharp cs302 home page


cps 220 computer systems organization fall 1996 cps 296 section 3 advanced topics computer architecture contact questions instructor alvin lebeck mail alvy cs duke time 10 30am 11 20am location d243 lsrc office hours monday wednesday 1 30pm 2 30pm appointment ta srikanth srinivasan mail sri cs duke location lsrc office hour tuesday 10 30am 11 30am appointment announcements contents suggestion box newsgroup synopsis grade composition quals information important dates handouts lectures homework exams research project resources synopsis content covers topics advanced computer architecture advanced undergraduates graduate students building introductory classes showed basic computer functions examines techniques improving computer performance usability emphasizes interaction hardware software operating systems compilers application programs cost performance tradeoffs computer architecture topics covered include virtual memory pipelining caches memory hierarchies advanced storage systems discuss variety parallel computer systems future directions computer architecture prerequisites cps 104 equivalent assumed familiar material covered cps 104 familiar material responsibility familiar questions required background textbook computer architecture quantitative approach 2nd edition john hennessy david patterson morgan kaufmann 1996 topics fundamentals computer architecture chapter 1 instruction set architecture chapter 2 appendix pipelining chapter 3 advanced pipelining chapter 4 memory hierarchy chapter 5 storage systems chapter 6 interconnection networks chapter 7 multiprocessors chapter 8 grade based 30 homework 30 project 30 exams midterms exit interview 10 class participation important quals grade based midterms exit interview homework 30 grade homework assigned semester handouts expected complete homework individually encourage discussion students topics covered class exams 30 grade midterm exams short exit interview important dates oresearch project 30 grade projects completed individually groups list projects provided students create web page presenting results projects give short presentation projects group projects expected entail work individual projects require 30 minute presentations 15 minutes student projects subject approval details provided semester select project september 30 list research resources tools links people selected projects important dates september 4 day class september 30 project selection october 14 midterm exam 7 9pm d106 lsrc october 21 fall break october 23 25 project status reports november 28 29 thanksgiving dec 6 project web pages due class day december 6 midterm ii exam december 9 exit interviews handouts homework due dates precise exercises subject change don officially assign problems handout 0 background handout 1 homework 1 due september 16 1996 handout 2 homework 2 due september 27 1996 handout 3 homework 3 due october 9 1996 handout 4 homework 4 due nov 8 1996 handout 5 homework 5 due dec 2 1996 resources links tools class morgan kauffman resourses 2nd edition duke computer architecture world wide computer architecture page mark hill dave patterson giving talk modified thu nov 14 14 00 43 est


computer graphics wed 5 7pm room 101 office hours 2 4pm wednesdays office 719 broadway rm 1224 students class learning java contributed troy downing syllabus emails class grader page


img cse 322 intro formal models winter 1996 richard ladner class messages check email frequently update 03 18 96 01pm handouts syllabus latex ps handout 1 latex ps constructing regular grammars regular expressions midterm extra latex ps ramblings ta question 5 exam handout 2 latex ps pda top parsing grammar handout 3 latex ps review final exam handout 4 latex ps proof halting problem undecidable exams midterm exam latex ps solutions latex ps final exam latex ps homework homework 1 latex ps due 1 8 96 solutions latex ps homework 2 latex ps due 1 12 96 solutions latex ps homework 3 latex ps due 1 19 96 solutions latex ps comments set notation homework 4 latex ps due 1 26 96 solutions latex ps homework 5 latex ps due 2 2 96 solutions latex ps homework 6 latex ps due 2 9 96 solutions text latex text ps state diagram ps homework 7 latex ps due 2 16 96 solutions text latex text ps state diagram ps homework 8 latex ps due 2 23 96 solutions text latex text ps state diagram ps homework 9 latex ps due 3 1 96 solutions latex ps homework 10 latex ps due 3 8 96 solutions latex text ps pda ps tm ps file formats materials provided formats html hypertext markup language html document format handled www browsers fact viewing html document handouts ve provided originally latex documents converted html latex2html bit strange latex plain ascii text including formating commands simple things assignments generally legible format figures complex math stuff hard impossible read postscript ghostscript home page free viewers mac windows os 2 linux 322 webs previous quarters autumn 1995 winter 1995 autumn 1994 autumn 1993 ladner cs washington fix cs washington update january 3 1996


3304 cs 480 individual design project fall 96 97 updated august 27 1996 img computer science home page img univ idaho home page instructors william junk assistant professor computer science dept university idaho moscow id 83844 1010 telephone 208 885 7530 fax 208 885 9052 mail billjunk cs uidaho karen assistant professor computer science dept university idaho moscow id 83844 1010 telephone 208 885 fax 208 885 9052 mail cs uidaho overview cs 480 design practicum stresses systematic software development techniques applied definition design coding testing documentation computer programming project student work individual project real customer prerequisites senior standing computer science completion eng 317 textbook required reference recent software engineering text provide information book suggested material important cs 481 code complete steve mcconnell microsoft press 1993 grading numerical grading system employed final grade based weighted sum points accumulated categories final grades determined curve based class performance case curve severe standard 90 80 70 curve document activity points proposal letter 40 project plan 50 oral requirements presentation 50 system requirements document 160 oral design presentation 70 system design document 200 usability test 30 code validation 200 beta test 20 project demonstration 50 user manual 80 project evaluation 30 weekly status reports 20 total 1000 bonus points early submission submit weekly status report img computer science home page img univ idaho home page billjunk cs uidaho


175 computer graphics fall 1996 description syllabus eric graduate student computer science email cs tufts assignments submit programs assignment 1 due oct 21 assignment 2 due nov 5 10 assignment 3 due nov 19 10 assignment 4 due dec 3 10 information documentation postscript man page lists subroutine calls postscript type man nfs res hci doc 3 shell script compile programs program information documentation postscript man page lists subroutine calls postscript type man nfs res hci doc 3 shell script compile programs program house house program info hci program tufts


computer sciences 302 algebraic language programming sections instructors comments suggestions complaints cs302 feedback provided clicking jim skrentny cs302 coordinator office 262 0191 email skrentny cs information sections cs 302 frequently asked questions overview microcomputer laboratories consultants fall 1996 consulting schedule tutors policy academic misconduct courses offered cs department software sections introduction microsoft windows hints windows compilers windows operating system email netscape creating subdirectories information savitch text book introduction borland language borland integrated development environment fortran information jeff lampert home page section 70 updated fri 8 30 96 jim skrentny cs302 coordinator skrentny cs wisc